Universality of trap models in the ergodic time scale

Abstract

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_x^N:x\in V_N\}$ with a distribution belonging to the basin of attraction of an $\alpha$-stable law, $0<\alpha <1$. Let $X_t^N$, $t\ge 0$, be a continuous time simple random walk on $G_N$ which waits a \emph{mean} $W_x^N$ 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ös-Rényi random graphs.

References in corpus (1)

• K-processes, scaling limit and aging for the trap model in the complete graph

Cited by in corpus (2)

• Elementary results on K processes with weights
• Aging of asymmetric dynamics on the random energy model