Related papers: Local ergodicity in the exclusion process on an in…
A classical fact in ergodic theory is that ergodicity is equivalent to almost everywhere divergence of ergodic sums of all nonnegative integrable functions which are not identically zero. We show two methods, one in the measure preserving…
Using the theory of negative association for measures and the notion of random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically…
In \cite{Ch91a} it was shown that the billiard ball map for the periodic Lorentz gas has infinite topological entropy. In this article we study the set of points with infinite Lyapunov exponents. Using the cell structure developed in…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We prove the Local Limit Theorems for bounded additive functionals of uniformly elliptic inhomogeneous Markov arrays. As an application we obtain the precise asymptotics in the large deviation regime for bounded additive functionals of…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
For Sina\"i's walk (X_k) we show that the empirical measure of the environment seen from the particle (\bar\w_k) converges in law to some random measure S. This limit measure is explicitly given in terms of the infinite valley, which…
We study the symmetric facilitated exclusion process (FEP) on the finite one-dimensional lattice $\lbrace 1,\dots ,N-1\rbrace$ when put in contact with boundary reservoirs, whose action is subject to an additional kinetic constraint in…
We consider random walks on marked simple point processes with symmetric jump rates and unbounded jump range. We prove homogenization properties of the associated Markov generators. As an application, we derive the hydrodynamic limit of the…
Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
This paper studies for a class of Z-extensions of dynamical systems including Z-periodic Lorentz gas the asymptotic behavior of the number of self-intersections of the trajectory of the flow. It concludes on a functional limit theorem for…
We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…
We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our main interest is in the chains that are not necessarily ergodic but rather decomposable into ergodic classes. To investigate the conditions under…
In this paper we consider a dynamic Erd\H{o}s-R\'{e}nyi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a subgraph count vector. The main result of this…
We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…
We use an inequality of Sidorenko to show a general relation between local and global subgraph counts and degree moments for locally weakly convergent sequences of sparse random graphs. This yields an optimal criterion to check when the…
The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…
We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs…
In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolation (SFP). In HRGs, $n=\Theta(\mathrm{e}^{R/2})$ vertices…