International audienceWe take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior at the edge, including the so called spectral gap. Results are obtained for two simple models with distinct limiting features. The first model is built on the complete graph while the second is a birth-and-death dynamics. Both models give rise to random matrices with non independent entries
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
Minor corrections.International audienceWe consider the random Markov matrix obtained by assigning i...
International audienceWe take on a Random Matrix theory viewpoint to study the spectrum of certain r...
International audienceWe take on a Random Matrix theory viewpoint to study the spectrum of certain r...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights t...
We compute spectra of large stochastic matrices W, defined on sparse random graphs in the configurat...
International audienceWe briefly review certain asymptotic properties of random Markov kernels on a ...
Abstract. Aldous ’ spectral gap conjecture asserts that on any graph the random walk process and the...
Correction in Proposition 4.3. Final version.International audienceWe investigate the spectrum of th...
46 pages, 6 figuresThis paper is a variation on the uniform spanning tree theme. We use random spann...
46 pages, 6 figuresThis paper is a variation on the uniform spanning tree theme. We use random spann...
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
Minor corrections.International audienceWe consider the random Markov matrix obtained by assigning i...
International audienceWe take on a Random Matrix theory viewpoint to study the spectrum of certain r...
International audienceWe take on a Random Matrix theory viewpoint to study the spectrum of certain r...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
+ self-adjointness, + almost-sure convergence, + stylistic changes +fixup in abstract and bibliograp...
We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights t...
We compute spectra of large stochastic matrices W, defined on sparse random graphs in the configurat...
International audienceWe briefly review certain asymptotic properties of random Markov kernels on a ...
Abstract. Aldous ’ spectral gap conjecture asserts that on any graph the random walk process and the...
Correction in Proposition 4.3. Final version.International audienceWe investigate the spectrum of th...
46 pages, 6 figuresThis paper is a variation on the uniform spanning tree theme. We use random spann...
46 pages, 6 figuresThis paper is a variation on the uniform spanning tree theme. We use random spann...
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge ...
Minor corrections.International audienceWe consider the random Markov matrix obtained by assigning i...