Fetching the paper…
Reading the bibliography…
We explore the problem of inferring the graph Laplacian of a weighted, undirected network from snapshots of a single or multiple discrete-time consensus dynamics, subject to parameter uncertainty, taking place on the network.
E. Kalnay, M. Kanamitsu, R. Kistler, W. Collins, D. Deaven, L. Gandin, M. Iredell, S. Saha, G. White, J. Woollen, Y. Zhu, A. Leetmaa, R. Reynolds, M. Chelliah, W. Ebisuzaki, W. Higgins, J. Janowiak, K. C. Mo, C. Ropelewski, J. Wang, R. Jenne, and D. Joseph, “The NCEP/NCAR 40-year reanalysis project,” Bulletin of the American Meteorological Society , vol. 77, no. 3, pp. 437–471, 1996
1996
Earlier work this paper cites.
S. H. Strogatz, “Exploring complex networks,” Nature , vol. 410, no. 6825, p. 268, 2001
2001
Earlier work this paper cites.
B. Bollobás, Random graphs . Cambridge University Press, 2001
2001
Earlier work this paper cites.
R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of modern physics , vol. 74, no. 1, p. 47, 2002
2002
Earlier work this paper cites.
A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Trans. Auto. Control , vol. 48, no. 6, pp. 988–1001, Jun. 2003
2003
Earlier work this paper cites.
A. Smola and R. Kondor, “Kernels and regularization on graphs,” in 16th Annual Conference on Computational Learning Theory , 2003
2003
Earlier work this paper cites.
W. Ren and R. W. Beard, “Consensus seeking in multiagent systems under dynamically changing interaction topologies,” IEEE Trans. Auto. Control , vol. 50, no. 5, pp. 655–661, May 2005
2005
Earlier work this paper cites.
L. A. Adamic and N. Glance, “The political blogosphere and the 2004 US election,” in Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem , 2005
2005
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, Jan. 2007
2007
Earlier work this paper cites.
I. S. Dhillon and J. A. Tropp, “Matrix nearness problems with Bregman divergences,” SIAM J. Matrix Anal. Appl. , vol. 29, no. 4, pp. 1120–1146, 2007
2007
Earlier work this paper cites.
S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, “An interior-point method for large-scale l1-regularized least squares,” IEEE J. Sel. Topics Signal Process. , vol. 4, no. 1, p. 606–617, 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.
E. J. Candes, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted ℓ 1 \ell_{1} minimization,” Journal of Fourier analysis and applications , vol. 14, no. 5-6, pp. 877–905, 2008
2008
Earlier work this paper cites.
A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring network structure, dynamics, and function using NetworkX,” in Proceedings of the 7th Python in Science Conference (SciPy2008) , Aug. 2008, pp. 11–15
2008
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic graphical models: Principles and techniques . MIT Press, 2009
2009
Earlier work this paper cites.
M. O. Jackson, Social and economic networks . Princeton university press, 2010
2010
Earlier work this paper cites.
P. Ravikumar, M. J. Wainwright, G. Baskutti, and B. Yu, “High-dimensional covariance estimation by minimizing ℓ 1 \ell_{1} -penalized log-determinant divergence,” Electronic Journal of Statistics , vol. 5, pp. 935–980, 2011
2011
Earlier work this paper cites.
S. Zhou, P. Rutimann, M. Xu, and P. Buhlmann, “High-dimensional covariance estimation based on gaussian graphical models,” Journal of Machine Learning Research , vol. 12, pp. 2975–3026, 2011
2011
Earlier work this paper cites.
M. Gomez-Rodriguez, J. Leskovec, and A. Krause, “Inferring networks of diffusion and influence,” ACM Transactions on Knowledge Discovery from Data , vol. 5, no. 4, 2012
2012
Cited alongside, same era.
R. Vershynin, “How close is the sample covariance matrix to the actual covariance matrix?” Journal of Theoretical Probability , vol. 25, no. 3, pp. 655–686, 2012
2012
Cited alongside, same era.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs,” IEEE Trans. Signal Process. , vol. 61, no. 7, pp. 1644–1656, Apr. 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, 2013
2013
Cited alongside, same era.
D. Thanou, X. Dong, D. Kressner, and P. Frossard, “Learning heat diffusion graphs,” IEEE Trans. Signal Inf. Process. Netw. , vol. 3, no. 3, pp. 484–499, 2017
2017
Later among the works it cites.
R. Shafipour, S. Segarra, A. G. Marques, and G. Mateos, “Network topology inference from non-stationary graph signals,” in IEEE Int. Conf. on Acoustics, Speech and Signal Process. , March 2017, pp. 5870–5874
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.
A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Stationary graph processes and spectral estimation,” IEEE Trans. Signal Process. , vol. 65, no. 22, pp. 5911–5926, 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…
M. Gomez-Rodriguez, J. Leskovec, D. Balduzzi, and B. Schölkopf, “Uncovering the structure and temporal dynamics of information propagation,” Network Science , vol. 2, no. 1, pp. 26–55, 2014
2014
Cited alongside, same era.
M. Timme and J. Casadiego, “Revealing networks from dynamics: an introduction,” Journal of Physics A: Mathematical and Theoretical , vol. 47, no. 34, p. 343001, 2014
2014
Cited alongside, same era.
A.-E. Saliba, A. J. Westermann, S. A. Gorski, and J. Vogel, “Single-cell rna-seq: advances and future challenges,” Nucleic acids research , vol. 42, no. 14, pp. 8845–8860, 2014
2014
Cited alongside, same era.
C. Gray, D. J. Baird, S. Baumgartner, U. Jacob, G. B. Jenkins, E. J. O’Gorman, X. Lu, A. Ma, M. J. Pocock, N. Schuwirth et al. , “Ecological networks: the missing links in biomonitoring science,” Journal of Applied Ecology , vol. 51, no. 5, pp. 1444–1449, 2014
2014
Cited alongside, same era.
Y. Yu, T. Wang, and R. J. Samworth, “A useful variant of the Davis-Kahan theorem for statisticians,” Biometrika , vol. 102, no. 2, pp. 315–323, 2014
2014
Cited alongside, same era.
M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” http://cvxr.com/cvx , Mar. 2014
2014
Cited alongside, same era.
S. Shahrampour and V. M. Preciado, “Topology identification of directed dynamical networks via power spectral analysis,” IEEE Transactions on Automatic Control , vol. 60, no. 8, pp. 2260–2265, 2015
2015
Cited alongside, same era.
B. Girault, “Stationary graph signals using an isometric graph translation,” in European Signal Process. Conf. (EUSIPCO) , Nice, France, Aug. 31-Sep. 4, 2015, pp. 1516–1520
2015
Cited alongside, same era.
N. Perraudin and P. Vandergheynst, “Stationary signal processing on graphs,” IEEE Trans. Signal Process. , vol. 65, no. 13, pp. 3462–3477, Jul. 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, Jul. 2017
2017
Later among the works it cites.
S. Segarra, Y. Wang, C. Uhler, and A. G. Marques, “Joint inference of networks from stationary graph signals,” in Asilomar Conf. Signals, Syst. Comp. , Oct 2017, pp. 975–979
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,” Proc. IEEE , vol. 106, no. 5, pp. 808–828, May 2018
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 Inf. Process. Netw. , vol. 4, no. 3, pp. 481–496, 2018
2018
Later among the works it cites.
H. E. Egilmez, E. Pavez, and A. Ortega, “Graph learning from filtered signals: Graph system and diffusion kernel identification,” IEEE Trans. Signal Inf. Process. Netw. , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
J. V. Lambers and A. C. Sumner, Explorations in Numerical Analysis . World Scientific Publishing Company, 2018
2018
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, 2019
2019
Closest in time.
X. Dong, D. Thanou, M. Rabbat, and P. Frossard, “Learning graphs from data: A signal representation perspective,” IEEE Signal Process. Mag. , vol. 36, no. 3, pp. 44–63, 2019
2019
Closest in time.
J. B. Lewis, K. Poole, H. Rosenthal, A. Boche, A. Rudkin, and L. Sonnet, “Voteview: Congressional roll-call votes database,” https://voteview.com/ , 2019
2019
Closest in time.
Y. Zhu, F. J. Iglesias, A. G. Marques, and S. Segarra, “Estimation of network processes via blind graph multi-filter identification,” in IEEE Int. Conf. on Acoustics, Speech and Signal Process. , May 2019, pp. 5451–5455
2019
Closest in time.