pith. sign in

arxiv: 0808.1502 · v3 · pith:AWJW5H5Cnew · submitted 2008-08-11 · 🧮 math.PR · math.SP

Circular Law Theorem for Random Markov Matrices

classification 🧮 math.PR math.SP
keywords randommarkovboundeddensitymatricesmatrixprobabilitysigma
0
0 comments X
read the original abstract

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum. In particular, when X11 follows an exponential law, then M belongs to the Dirichlet Markov Ensemble of random stochastic matrices. Our main result states that with probability one, the counting probability measure of the complex spectrum of n^(1/2)M converges weakly as n tends to infinity to the uniform law on the centered disk of radius sigma/m. The bounded density assumption is purely technical and comes from the way we control the operator norm of the resolvent.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.