2000 character limit reached
The K-process on a tree as a scaling limit of the GREM-like trap model
Published 18 Feb 2012 in math.PR | (1202.4104v3)
Abstract: We introduce trap models on a finite volume -level tree as a class of Markov jump processes with state space the leaves of that tree. They serve to describe the GREM-like trap model of Sasaki and Nemoto. Under suitable conditions on the parameters of the trap model, we establish its infinite volume limit, given by what we call a -process in an infinite -level tree. From this we deduce that the -process also is the scaling limit of the GREM-like trap model on extreme time scales under a fine tuning assumption on the volumes.
Paper Prompts
Sign up for free to create and run prompts on this paper.