The Laplacian Spectrum of Large Graphs Sampled from Graphons

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively approximated by using the degree function of the corresponding graphon. More specifically, we show how to approximate the distribution of the Laplacian eigenvalues and the average effective resistance (Kirchhoff index) of the graph. For all cases, we provide explicit bounds on the approximation errors and derive the asymptotic rates at which the errors go to zero when the number of nodes goes to infinity. Our main results are proved under the conditions that the graphon is piecewise Lipschitz and bounded away from zero.

[1]  Fabio Fagnani,et al.  Averaging with Exogenous Inputs and Electrical Networks , 2018 .

[2]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[3]  Ulrike von Luxburg,et al.  Limits of Spectral Clustering , 2004, NIPS.

[4]  Luca Schenato,et al.  A Survey on Distributed Estimation and Control Applications Using Linear Consensus Algorithms , 2010 .

[5]  Mikhail Belkin,et al.  Consistency of spectral clustering , 2008, 0804.0678.

[6]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[7]  Hiroya Nakao,et al.  Localization of Laplacian eigenvectors on random networks , 2017, Scientific Reports.

[8]  Fan Chung Graham,et al.  The Diameter and Laplacian Eigenvalues of Directed Graphs , 2006, Electron. J. Comb..

[9]  Santiago Segarra,et al.  Centrality Measures for Graphons: Accounting for Uncertainty in Networks , 2017, IEEE Transactions on Network Science and Engineering.

[10]  Federica Garin,et al.  Graphon-Based Sensitivity Analysis of SIS Epidemics , 2020, IEEE Control Systems Letters.

[11]  Fabio Fagnani,et al.  Average Resistance of Toroidal Graphs , 2015, SIAM J. Control. Optim..

[12]  Proceedings of the 2019 ACM Conference on Economics and Computation , 2019, EC.

[13]  Peter E. Caines,et al.  Optimal and Approximate Solutions to Linear Quadratic Regulation of a Class of Graphon Dynamical Systems , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[14]  Sandro Zampieri,et al.  Resistance-Based Performance Analysis of the Consensus Algorithm over Geometric Graphs , 2013, SIAM J. Control. Optim..

[15]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[16]  Alejandro Ribeiro,et al.  The Graphon Fourier Transform , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[17]  B. Mohar,et al.  Eigenvalues in Combinatorial Optimization , 1993 .

[18]  Francesca Parise,et al.  Graphon Games , 2018, EC.

[19]  S. Janson.  Graphons, cut norm and distance, couplings and rearrangements , 2010, 1009.2376.

[20]  Francesco Bullo,et al.  Electrical Networks and Algebraic Graph Theory: Models, Properties, and Applications , 2018, Proceedings of the IEEE.

[21]  A. Voros,et al.  Spectral Zeta Functions , 1992 .

[22]  Y. Saad,et al.  Numerical Methods for Large Eigenvalue Problems , 2011 .

[23]  M. Bálek,et al.  Large Networks and Graph Limits , 2022 .

[24]  Alejandro Ribeiro,et al.  Graphon Signal Processing. , 2020 .

[25]  Choujun Zhan,et al.  On the distributions of Laplacian eigenvalues versus node degrees in complex networks , 2010 .

[26]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[27]  V. Klee,et al.  Combinatorial and graph-theoretical problems in linear algebra , 1993 .

[28]  Peter E. Caines,et al.  LQG Graphon Mean Field Games , 2020, ArXiv.

[29]  J. Hespanha,et al.  Estimation on graphs from relative measurements , 2007, IEEE Control Systems.

[30]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[31]  Svante Janson.  A graphon counter example , 2020, Discret. Math..

[32]  Elena Panteley,et al.  On the Influence of Noise in Randomized Consensus Algorithms , 2020, IEEE Control Systems Letters.

[33]  Shuang Gao,et al.  Graphon Control of Large-Scale Networks of Linear Systems , 2018, IEEE Transactions on Automatic Control.

[34]  Fan Chung Graham,et al.  On the Spectra of General Random Graphs , 2011, Electron. J. Comb..

[35]  Sushant Sachdeva,et al.  Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[36]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

[37]  Peter E. Caines,et al.  Spectral Representations of Graphons in Very Large Network Systems Control , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[38]  Timoteo Carletti,et al.  Random Walks on Dense Graphs and Graphons , 2019, SIAM Journal on Applied Mathematics.