English

Spectrum of large random Markov chains: heavy-tailed weights on the oriented complete graph

Spectral Theory 2017-06-30 v2 Combinatorics Probability

Abstract

We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge of the complete oriented graph. In this study, the weights have unbounded first moment and belong to the domain of attraction of an alpha-stable law. We prove that as the dimension tends to infinity, the empirical measure of the singular values tends to a probability measure which depends only on alpha, characterized as the expected value of the spectral measure at the root of a weighted random tree. The latter is a generalized two-stage version of the Poisson weighted infinite tree (PWIT) introduced by David Aldous. Under an additional smoothness assumption, we show that the empirical measure of the eigenvalues tends to a non-degenerate isotropic probability measure depending only on alpha and supported on the unit disc of the complex plane. We conjecture that the limiting support is actually formed by a strictly smaller disc.

Keywords

Cite

@article{arxiv.1610.01836,
  title  = {Spectrum of large random Markov chains: heavy-tailed weights on the oriented complete graph},
  author = {Charles Bordenave and Pietro Caputo and Djalil Chafaï and Daniele Piras},
  journal= {arXiv preprint arXiv:1610.01836},
  year   = {2017}
}

Comments

Minor corrections

R2 v1 2026-06-22T16:13:00.409Z