Related papers: Local ergodicity in the exclusion process on an in…
We consider the symmetric simple exclusion process in $\mathbb Z^d$ with quenched bounded dynamic random conductances and prove its hydrodynamic limit in path space. The main tool is the connection, due to the self-duality of the process,…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…
Given $1\leq p<\infty$, we show that ergodic flows in the $L^p$-space over a $\sigma$-finite measure space generated by strongly continuous semigroups of Dunford-Schwartz operators and modulated by bounded Besicovitch almost periodic…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We consider the ergodicity and consensus problem for a discrete-time linear dynamic model driven by random stochastic matrices, which is equivalent to studying these concepts for the product of such matrices. Our focus is on the model where…
We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…
We obtain a local central limit theorem for cocycles associated with a class of non abelian and non compact group extensions of Gibbs Markov maps. This class consists of multidimensional infinite dihedral groups. Unlike in the set up of the…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We present a new proof of an Ergodic theorem for Wide-Sense Stationary Random Processes added with a new canonical sampling theorem of mine for finite time duration signals in the frequency domain (periodograms) which is free from the…
We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points…
We prove sharp bounds on the probability that the simple random walk on a vertex-transitive graph escapes the ball of radius $r$ before returning to its starting point. In particular, this shows that if the ball of radius $r$ has size…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…