A note on a local ergodic theorem for an infinite tower of coverings

This is a note on a local ergodic theorem for a symmetric exclusion process defined on an infinite tower of coverings, which is associated with a finitely generated residually finite amenable group.Comment: Final version to appear in Springer Proceedings in Mathematics and Statistic

Universality of trap models in the ergodic time scale

Consider a sequence of possibly random graphs $G_N=(V_N, E_N)$, $N\ge 1$, whose vertices's have i.i.d. weights $\{W^N_x : x\in V_N\}$ with a distribution belonging to the basin of attraction of an $\alpha$-stable law, $0<\alpha<1$. Let $X^N_t$, $t \ge 0$, be a continuous time simple random walk on $G_N$ which waits a \emph{mean} $W^N_x$ exponential time at each vertex $x$. Under considerably general hypotheses, we prove that in the ergodic time scale this trap model converges in an appropriate topology to a $K$-process. We apply this result to a class of graphs which includes the hypercube, the $d$-dimensional torus, $d\ge 2$, random $d$-regular graphs and the largest component of super-critical Erd\"os-R\'enyi random graphs

A simple renormalization flow for FK-percolation models

We present a setup that enables to define in a concrete way a renormalization flow for the FK-percolation models from statistical physics (that are closely related to Ising and Potts models). In this setting that is applicable in any dimension of space, one can interpret perturbations of the critical (conjectural) scaling limits in terms of stationary distributions for rather simple Markov processes on spaces of abstract discrete weighted graphs.Comment: 12 pages, to appear in the Jean-Michel Bismut 65th anniversary volum