Spectral Statistics of Lattice Graph Percolation Models
Stephen Kruzick, Jose M. F. Moura

TL;DR
This paper analyzes the spectral distribution of eigenvalues in lattice graph percolation models, providing a deterministic approximation for the eigenvalue distribution of random adjacency matrices using Girko's stochastic methods.
Contribution
It introduces a novel application of Girko's stochastic canonical equations to approximate the spectral distribution of percolated lattice graphs, reducing computational complexity.
Findings
Deterministic spectral distribution approximates empirical data
Method reduces the number of equations needed for analysis
Simulations validate the accuracy of the approximation
Abstract
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the eigenvectors provide a spectral basis. This is useful, for example, in the design of filters. However, the graph or network may be uncertain due to stochastic influences in construction and maintenance, and, under such conditions, the eigenvalues of the shift matrix become random variables. This paper examines the spectral distribution of the eigenvalues of random networks formed by including each link of a D-dimensional lattice supergraph independently with identical probability, a percolation model. Using the stochastic canonical equation methods developed by Girko for symmetric matrices with independent upper triangular entries, a deterministic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Complex Network Analysis Techniques · Opinion Dynamics and Social Influence
