اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe K-process on a tree as a scaling limit of the GREM-like trap model
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 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 s
how 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.
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 conv
ergence criteria proposed by Fontes, Isopi, Newman and Ravishankar.
We consider a class of continuous-time stochastic growth models on $d$-dimensional lattice with non-negative real numbers as possible values per site. We remark that the diffusive scaling limit proven in our previous work [Nagahata, Y., Yoshida, N.:
Central Limit Theorem for a Class of Linear Systems, Electron. J. Probab. Vol. 14, No. 34, 960--977. (2009)] can be extended to wider class of models so that it covers the cases of potlatch/smoothing processes.
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical region (i.e., where the branching process survives w
ith positive probability) exponential decay of avalanche sizes. This shows a phase transition phenomenon between exponential decay and power law decay of avalanche sizes. Our main technical tools are: (1) A recursion for the ratio between the numbers of weakly and strongly allowed configurations which is proved to have a well-defined stochastic solution; (2) quenched and annealed estimates of the eigenvalues of a product of $n$ random transfer matrices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
