Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userK-processes, scaling limit and aging for the trap model in the complete graph
240
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
We obtain scaling limit results for asymmetric trap models and their infinite volume counterparts, namely asymmetric K processes. Aging results for the latter processes are derived therefrom.
We introduce trap models on a finite volume $k$-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 $K$-process in an infinite $k$-level tree. From this we deduce that the $K$-process also is the scaling limit of the GREM-like trap model on extreme time scales under a fine tuning assumption on the volumes.
We discuss the long term behaviour of trap models on the integers with asymptotically vanishing drift, providing scaling limit theorems and ageing results. Depending on the tail behaviour of the traps and the strength of the drift, we identify three different regimes, one of which features a previously unobserved limit process.
We give the ``quenched scaling limit of Bouchauds trap model in ${dge 2}$. This scaling limit is the fractional-kinetics process, that is the time change of a $d$-dimensional Brownian motion by the inverse of an independent $alpha$-stable subordinator.
We consider the two dimensional version of a drainage network model introduced by Gangopadhyay, Roy and Sarkar, and show that the appropriately rescaled family of its paths converges in distribution to the Brownian web. We do so by verifying the convergence criteria proposed by Fontes, Isopi, Newman and Ravishankar.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
