Spectrum of large random reversible markov chains: Heavy-tailed weights on the complete graph

40Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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 as- sumedtobeinthedomainofattractionofanα-stable law, α Σ (0, 2).When 1 ≤ α<2, we show that for a suitable regularly varying sequence κn of index 1 - 1/α, the limiting spectral distribution μα of κn K coincides with the one of the random symmetric matrix of the un-normalized weights (Lévy matrix with i.i.d. entries). In contrast, when 0

Cite

CITATION STYLE

APA

Bordenave, C., Caputo, P., & Chafaï, D. (2011). Spectrum of large random reversible markov chains: Heavy-tailed weights on the complete graph. Annals of Probability, 39(4), 1544–1590. https://doi.org/10.1214/10-AOP587

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free