Fetching the paper…
Reading the bibliography…
The first step for any graph signal processing (GSP) procedure is to learn the graph signal representation, i.e., to capture the dependence structure of the data into an adjacency matrix.
P. Erdös and A. Rényi, “On random graphs,” Publ. Math. Debrecen
1959
Earlier work this paper cites.
P.W. Holland, K. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Social Networks
1983
Earlier work this paper cites.
D. Clarkson, “Remark AS R74: A least squares version of algorithm AS 211: The F-G diagonalization algorithm,” Applied Statistics
1988
Earlier work this paper cites.
A. Belouchrani, K. Abed-Meraim, J. F. Cardoso, and E. Moulines, “A blind source separation technique using second-order statistics,” IEEE Trans. Signal Process
1997
Earlier work this paper cites.
S.A. Vorobyov, A.B. Grshman, and Z.-Q. Luo, “Robust adaptive beamforming using worst-case performance optimization: A solution to the signal mismatch problem,” IEEE Trans. Signal Process
2003
Earlier work this paper cites.
L. Lovász and B. Szegedy, “Limits of dense graph sequences,” Journal of Combinatorial Theory B
2006
Earlier work this paper cites.
B. Bollobás, S. Janson and O. Riordan, “The phase transition in inhomogeneous random graphs,” Random Structures and Algorithms
2007
Earlier work this paper cites.
F. Blöchl, A. Kowarsch, and F. J. Theis, “Second-order source separation based on prior knowledge realized in a graph model,” in “Latent Variable Analysis and Signal Separation,” LNCS
2010
Earlier work this paper cites.
P. Ilmonen, K. Nordhausen, H. Oja, and E. Ollila, “A new performance index for ICA: Properties computation and asymptotic analysis,” in “Latent Variable Analysis and Signal Separation,” LNCS
2010
Earlier work this paper cites.
S. Y. Tu and A. H. Sayed, “Mobile adaptive networks,” IEEE J. Select. Topics Signal Process
2011
Earlier work this paper cites.
L. Lovász, Large networks and graph limits
2012
Earlier work this paper cites.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs,” IEEE Trans. Signal Process
2013
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Process. Magazine
2013
Earlier work this paper cites.
D. Acemoglu, G. Como, F. Fagnani, and A. Ozdaglar, “Opinion fluctuations and disagreement in social networks,” Mathematics of Operations Research
2013
Earlier work this paper cites.
A. Sandryhaila, S. Kar, and J. M. Moura, “Finite-time distributed consensus through graph filters,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process
2014
Earlier work this paper cites.
E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer, “Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery,” IEEE Trans. Network Science and Engineering
2014
Earlier work this paper cites.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs: Frequency analysis,” IEEE Trans. Signal Processing
2014
Cited alongside, same era.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovacevic, “Discrete signal processing on graphs: Sampling theory,” IEEE Trans. Signal Process
2015
Cited alongside, same era.
S. Safavi and U. A. Khan, “Revisiting finite-time distributed algorithms via successive nulling of eigenvalues,” IEEE Signal Process. Letters
2015
Cited alongside, same era.
K. Avrachenkov, L. Cottatellucci, L. and A. Kadavankandy, “Spectral properties of random matrices for stochastic block model,” in Proc. IEEE International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
2015
Cited alongside, same era.
W. Huang, L. Goldsberry, N. F. Wymbs, S. T. Grafton, D. S. Bassett, and A. Ribeiro, “Graph frequency analysis of brain signals,” IEEE J. Select. Topics Signal Process
S. Kruzick and J. M. Moura, “Optimal filter design for signal processing on random graphs: Accelerated consensus,” IEEE Trans. Signal Process
2017
Later among the works it cites.
E. Isufi, A. Loukas, A. Simonetto and G. Leus, “Filtering random graph processes over random time-varying graphs,” IEEE Trans. Signal Process
2017
Later among the works it cites.
T. Cai, T. Liang, and A. Rakhlin, “On detection and structural reconstruction of small-world random networks,” IEEE Trans. Network Science and Engineering
2017
Later among the works it cites.
M. W. Morency and G. Leus, “Signal processing on kernel-based random graphs,” in Proc. European Signal Processing Conference
2017
Later among the works it cites.
S. P. Chepuri and G. Leus, “Graph sampling for covariance estimation,” IEEE Trans. Signal and Information Processing over Networks
2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Sampling of graph signals with successive local aggregations,” IEEE Trans. Signal Process
2016
Cited alongside, same era.
S. Segarra, A. G. Marques, G. Leus, and A. Ribeiro, “Reconstruction of graph signals through percolation from seeding nodes,” IEEE Trans. Signal Process
2016
Cited alongside, same era.
X. Dong, D. Thanou, P. Frossard, and P. Vandergheynst, “Learning Laplacian matrix in smooth graph signal representations,” IEEE Trans. Signal Process
2016
Cited alongside, same era.
S. Segarra, and A. Ribeiro, “Stability and continuity of centrality measures in weighted graphs,” IEEE Trans. Signal Process
2016
Cited alongside, same era.
National Climatic Data Center
2016
Cited alongside, same era.
J. Miettinen, K. Illner, K. Nordhausen, H. Oja, S. Taskinen, and F. Theis, “Separation of uncorrelated stationary time series using autocovariance matrices,” Journal of Time Series Analysis
2016
Cited alongside, same era.
A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Stationary graph processes and spectral estimation,” IEEE Trans. Signal Process
2017
Cited alongside, same era.
Later among the works it cites.
E. Isufi, A. Loukas, A. Simonetto and G. Leus, “Autoregressive moving average graph filtering,” IEEE Trans. Signal Processing
2017
Later among the works it cites.
A. Ortega, P. Frossard, J. Kovacevic, J. M. F. Moura and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE
2018
Later among the works it cites.
B. Pasdeloup, V. Gripon, G. Mercier, D. Pastor, and M. G.Rabbat, “Characterization and inference of graph diffusion processes from observations of stationary signals,” IEEE Trans. Signal and Information Processing over Networks
2018
Later among the works it cites.
J. Miettinen, S.A. Vorobyov, and E. Ollila, “Graph error effect in graph signal processing,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Closest in time.
E. Isufi, A. Loukas, A. Simonetto and G. Leus, “On the transferability of spectral graph filters,” in Proc. Int. Conf. Sampling Theory and Applications
2019
Closest in time.
E. Ceci and S. Barbarossa, “Graph signal processing in the presence of topology uncertainties,” IEEE Trans. Signal Process
2020
Closest in time.
E. Ceci, Y. Shen, G. B. Giannakis and S. Barbarossa, “Graph-based learning under perturbations via total least-squares,” IEEE Trans. Signal Process
2020
Closest in time.