Spectrum of large random reversible Markov chains: Heavy-tailed weights on the complete graph
Charles Bordenave, Pietro Caputo, Djalil Chafa\"i

TL;DR
This paper analyzes the spectral properties of large random reversible Markov chains with heavy-tailed weights, revealing different limiting behaviors depending on the tail index, and connects these to stable laws and infinite tree structures.
Contribution
It characterizes the spectral distributions of heavy-tailed weighted Markov chains, linking them to stable laws and Poisson weighted infinite trees, and studies their invariant measures.
Findings
For 1 ≤ α < 2, spectral distribution matches that of un-normalized weights.
For 0 < α < 1, spectral distribution converges to a law supported on [-1,1].
The invariant measure's limiting behavior is also characterized.
Abstract
We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The weights are assumed to be in the domain of attraction of an -stable law, . When , we show that for a suitable regularly varying sequence of index , the limiting spectral distribution of coincides with the one of the random symmetric matrix of the un-normalized weights (L\'{e}vy matrix with i.i.d. entries). In contrast, when , we show that the empirical spectral distribution of K converges without rescaling to a nontrivial law supported on [-1,1], whose moments are the return probabilities of the random walk on the Poisson weighted infinite tree (PWIT) introduced by…
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.
