No abstract

We prove a functional central limit theorem for additive functionals of stationary reversible ergodic Markov chains under virtually no assumptions other than the necessary ones. We use these results to study the asymptotic behavior of a tagged particle in an infinite particle system performing simple excluded random walk.

No abstract

No abstract

No abstract

No abstract

What does an Erdős-Rényi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and proof of the main result uses the recent development of the theory of graph limits by Lovász and coauthors and Szemerédi's regularity lemma from graph theory. As a basic application of the general principle, we work out large deviations for the number of triangles in G(n, p). Surprisingly, even this simple example yields an interesting double phase transition.

No abstract