K-processes, scaling limit and aging for the trap model in the complete graph
Probability
2008-08-27 v1
Abstract
We study K-processes, which are Markov processes in a denumerable state space, all of whose elements are stable, with the exception of a single state, starting from which the process enters finite sets of stable states with uniform distribution. We show how these processes arise, in a particular instance, as scaling limits of the trap model in the complete graph, and subsequently derive aging results for those models in this context.
Cite
@article{arxiv.0808.3494,
title = {K-processes, scaling limit and aging for the trap model in the complete graph},
author = {L. R. G. Fontes and P. Mathieu},
journal= {arXiv preprint arXiv:0808.3494},
year = {2008}
}
Comments
Published in at http://dx.doi.org/10.1214/07-AOP360 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)