Fetching the paper…
Reading the bibliography…
Networks and data supported on graphs have become ubiquitous in the sciences and engineering.
C. Davis and W. Kahan, “The rotation of eigenvectors by a perturbation. iii,” SIAM Journal on Numerical Analysis , vol. 7, no. 1, pp. 1–46, 1970
1970
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Social Networks , vol. 5, no. 2, pp. 109–137, Jun. 1983
1983
Earlier work this paper cites.
M. Wax and T. Kailath, “Detection of signals by information theoretic criteria,” IEEE Trans. Acoust., Speech and Signal Process. , vol. 33, no. 2, pp. 387–392, Apr. 1985
1985
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank citation ranking: Bringing order to the web,” Stanford InfoLab, Technical Report 1999-66, November 1999
1999
Earlier work this paper cites.
S. H. Strogatz, “Exploring complex networks,” Nature , vol. 410, no. 6825, pp. 268–276, Mar. 2001
2001
Earlier work this paper cites.
R. Milo, E. Al, and C. Biology, “Network motifs: Simple building blocks of complex networks,” Science , vol. 298, no. 5594, pp. 824–827, Oct. 2002
2002
Earlier work this paper cites.
M. E.J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review. E, Statistical, nonlinear, and soft matter physics , vol. 69, p. 026113, Mar. 2004
2004
Earlier work this paper cites.
A. Kumar, Y. Sabharwal, and S. Sen, “A simple linear time ( 1 + ϵ ) (1+\epsilon) -approximation algorithm for k k -means clustering in any dimensions,” in IEEE Symp. on Foundations of Comp. Sci. , 2004, pp. 454–462
2004
Earlier work this paper cites.
M. E. J. Newman, “Modularity and community structure in networks,” Proc. of the National Academy of Sciences , vol. 103, no. 23, pp. 8577–8582, Jun. 2006
2006
Earlier work this paper cites.
J. Damoiseaux, S. Rombouts, F. Barkhof, P. Scheltens, C. Stam, S. M. Smith, and C. Beckmann, “Consistent resting-state networks across healthy subjects,” Proc. of the National Academy of Sciences , vol. 103, no. 37, pp. 13 848–13 853, Aug. 2006
2006
Earlier work this paper cites.
N. Meinshausen and P. Buhlmann, “High-dimensional graphs and variable selection with the lasso,” Ann. of Stat. , vol. 34, no. 3, pp. 1436–1462, 2006
2006
Earlier work this paper cites.
U. Von Luxburg, “A tutorial on spectral clustering,” Statistics and computing , vol. 17, no. 4, pp. 395–416, Dec. 2007
2007
Earlier work this paper cites.
M. E. J. Newman and E. A. Leicht, “Mixture models and exploratory analysis in networks,” Proc. of the National Academy of Sciences , vol. 104, no. 23, pp. 9564–9569, Jul. 2007
2007
Earlier work this paper cites.
R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proc. IEEE , vol. 95, no. 1, pp. 215–233, Mar. 2007
2007
Earlier work this paper cites.
J. Friedman, T. Hastie, and R. Tibshirani, “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics , vol. 9, no. 3, pp. 432–441, Jul. 2008
2008
Earlier work this paper cites.
J. Friedman, T. Hastie, and R. Tibshirani, “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics , vol. 9, no. 3, pp. 432–441, 2008
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
P. Bickel and E. Levina, “Covariance regularization by thresholding,” Ann. of Stat. , vol. 36, no. 6, pp. 2577–2604, Feb. 2009
2009
Earlier work this paper cites.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms , 3rd ed. The MIT Press, 2009
2009
Earlier work this paper cites.
M. E. J. Newman, Networks: An Introduction . Oxford University Press, USA, Mar. 2010
2010
Cited alongside, same era.
M. O. Jackson, Social and Economic Networks . Princeton university press, 2010
2010
Cited alongside, same era.
B. M. Lake and J. B. Tenenbaum, “Discovering structure by learning sparse graphs,” in Annual Cognitive Sc. Conf. , Aug. 2010, pp. 778–783
2010
Cited alongside, same era.
B. Ball, B. Karrer, and M. E J Newman, “Efficient and principled method for detecting communities in networks,” Physical Review. E, Statistical, nonlinear, and soft matter physics , vol. 84, p. 036103, Sep. 2011
2011
Cited alongside, same era.
B. Karrer and M. Newman, “Stochastic blockmodels and community structure in networks,” Physical Review. E, Statistical, nonlinear, and soft matter physics , vol. 83, p. 016107, Jan. 2011
2011
S. Segarra, M. T. Schaub, and A. Jadbabaie, “Network inference from consensus dynamics,” in IEEE Conf. Decision and Control (CDC) , Dec. 2017, pp. 3212–3217
2017
Later among the works it cites.
S. Segarra, G. Mateos, A. G. Marques, and A. Ribeiro, “Blind identification of graph filters,” IEEE Trans. Signal Process. , vol. 65, no. 5, pp. 1146–1159, Mar. 2017
2017
Later among the works it cites.
H. E. Egilmez, E. Pavez, and A. Ortega, “Graph learning from data under Laplacian and structural constraints,” IEEE J. Sel. Topics Signal Process. , vol. 11, no. 6, pp. 825–841, Sep. 2017
2017
Later among the works it cites.
Y. Shen, B. Baingana, and G. B. Giannakis, “Kernel-based structural equation models for topology identification of directed networks,” IEEE Trans. Signal Process. , vol. 65, no. 10, pp. 2503–2516, May 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
K. Rohe, S. Chatterjee, B. Yu et al. , “Spectral clustering and the high-dimensional stochastic blockmodel,” The Annals of Statistics , vol. 39, no. 4, pp. 1878–1915, 2011
2011
Cited alongside, same era.
O. Sporns, Discovering the Human Connectome . Boston, MA: MIT Press, 2012
2012
Cited alongside, same era.
R. Vershynin, “Introduction to the non-asymptotic analysis of random matrices,” in Compressed Sensing: Theory and Applications , Y. C. Eldar and G. Kutyniok, Eds. Cambridge university press, 2012
2012
Cited alongside, same era.
R. A. Horn and C. R. Johnson, Matrix analysis . Cambridge university press, 2012
2012
Cited alongside, same era.
S. Shahrampour and V. M. Preciado, “Reconstruction of directed networks from consensus dynamics,” in American Control Conf. (ACC) , Jun. 2013, pp. 1685–1690
2013
Cited alongside, same era.
X. Cai, J. A. Bazerque, and G. B. Giannakis, “Sparse structural equation modeling for inference of gene regulatory networks exploiting genetic perturbations,” PLOS, Computational Biology , vol. 8, no. 12, Dec. 2013
2013
Cited alongside, same era.
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. Mag. , vol. 30, no. 3, pp. 83–98, Apr. 2013
2013
Cited alongside, same era.
S. Segarra, A. G. Marques, G. Mateos, and A. Ribeiro, “Network topology inference from spectral templates,” IEEE Trans. Signal Inf. Process. Netw. , vol. 3, no. 3, pp. 467–483, Aug. 2017
2017
Later among the works it cites.
E. Abbe, “Community detection and stochastic block models: Recent developments,” J. Mach. Learn. Res , vol. 18, pp. 1–86, Apr. 2017
2017
Later among the works it cites.
N. Masuda, M. A. Porter, and R. Lambiotte, “Random walks and diffusion on networks,” Physics Reports , vol. 716, pp. 1–58, Nov. 2017
2017
Later among the works it cites.
S. Segarra, A. G. Marques, and A. Ribeiro, “Optimal graph-filter design and applications to distributed linear network operators,” IEEE Trans. Signal Process. , vol. 65, no. 15, pp. 4117–4131, Aug. 2017
2017
Later among the works it cites.
X. Wu, H. T. Wai, and A. Scaglione, “Estimating social opinion dynamics models from voting records,” IEEE Trans. Signal Process. , vol. 66, no. 16, pp. 4193–4206, Aug. 2018
2018
Later among the works it cites.
W. Huang, T. A. W. Bolton, J. D. Medaglia, D. S. Bassett, A. Ribeiro, and D. Van De Ville, “A graph signal processing perspective on functional brain imaging,” Proc. IEEE , vol. 106, no. 5, pp. 868–885, May 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
M. T. Schaub, S. Segarra, and H. Wai, “Spectral partitioning of time-varying networks with unobserved edges,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP) , May 2019, pp. 4938–4942
2019
Later among the works it cites.
2019
Later among the works it cites.
G. Mateos, S. Segarra, A. G. Marques, and A. Ribeiro, “Connecting the dots: Identifying network structure via graph signal processing,” IEEE Signal Process. Mag. , vol. 36, no. 3, pp. 16–43, May 2019
2019
Later among the works it cites.
M. T. Schaub, S. Segarra, and J. Tsitsiklis, “Blind identification of stochastic block models from dynamical observations,” SIAM J. Math. Data Science (SIMODS) (under review) , 2019
2019
Later among the works it cites.
H.-T. Wai, S. Segarra, A. E. Ozdaglar, A. Scaglione, and A. Jadbabaie, “Blind community detection from low-rank excitations of a graph filter,” IEEE Trans. Signal Process. (under review) , 2019
2019
Later among the works it cites.
T. M. Roddenberry and S. Segarra, “Blind inference of centrality rankings from graph signals,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP) (submitted) , 2019
2019
Later among the works it cites.
Y. He and H. Wai, “Estimating centrality blindly from low-pass filtered graph signals,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP) (submitted) , 2019
2019
Later among the works it cites.