Random reversible Markov matrices with tunable extremal eigenvalues

From MaRDI portal




Abstract: Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix c>0 and p>0. Let An be the adjacency matrix of a random graph following mathrmG(n,p/n), known as the ErdH{o}s-R'enyi distribution. Add c/n to each entry of An and then normalize its rows. It is shown that the resulting Markov matrix has the desired properties. Its ESD weakly converges in probability to a symmetric nondegenerate distribution, and its extremal eigenvalues, other than 1, fall in [1/sqrt1+c/k,b]cup[b,1/sqrt1+c/k] for any 0<b<1/sqrt1+c, where k=lfloorpfloor+1. Thus, for pin(0,1), the spectral gap tends to 11/sqrt1+c.









This page was built for publication: Random reversible Markov matrices with tunable extremal eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341612)