اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLoop-erased random walk as a spin system observable
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The determination of the Hausdorff dimension of the scaling limit of loop-erased random walk is closely related to the study of the one-point function of loop-erased random walk, i.e., the probability a loop-erased random walk passes through a given vertex. Recent work in the theoretical physics literature has investigated the Hausdorff dimension of loop-erased random walk in three dimensions by applying field theory techniques to study spin systems that heuristically encode the one-point function of loop-erased random walk. Inspired by this, we introduce two different spin systems whose correlation functions can be rigorously shown to encode the one-point function of loop-erased random walk.
قيم البحث
اقرأ أيضاً
We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants of SLE$_8$
. In this article, we derive the scaling limit of the loop-erased random walk branch (LERW) in the UST. They are variants of SLE$_2$. The conclusion is a generalization of [HLW20,Theorem 1.6] where the authors derive the scaling limit of the LERW branch of UST when $N=2$. When $N=2$, the limiting law is SLE$_2(-1,-1; -1, -1)$. However, the limiting law is nolonger in the family of SLE$_2(rho)$ process as long as $Nge 3$.
In the randomly-oriented Manhattan lattice, every line in $mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the direction fix
ed by the line orientations. Random walk on this directed graph chooses uniformly from the $d$ legal neighbours at each step. We prove that this walk is superdiffusive in two and three dimensions. The model is diffusive in four and more dimensions.
We consider the Activated Random Walk model on $mathbb{Z}$. In this model, each particle performs a continuous-time simple symmetric random walk, and falls asleep at rate $lambda$. A sleeping particle does not move but it is reactivated in the presen
ce of another particle. We show that for any sleep rate $lambda < infty$ if the density $ zeta $ is close enough to $1$ then the system stays active.
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to passive, then sto
pping to jump. When particles of both types occupy the same site, they all become active. This model exhibits phase transition in the sense that for low initial densities the system locally fixates and for high densities it keeps active. Though extensively studied in the physics literature, the matter of giving a mathematical proof of such phase transition remained as an open problem for several years. In this work we identify some variables that are sufficient to characterize fixation and at the same time are stochastically monotone in the models parameters. We employ an explicit graphical representation in order to obtain the monotonicity. With this method we prove that there is a unique phase transition for the one-dimensional finite-range random walk. Joint with V. Sidoravicius. * BROKEN LINE PROCESS * We introduce the broken line process and derive some of its properties. Its discrete version is presented first and a natural generalization to the continuum is then proposed and studied. The broken lines are related to the Young diagram and the Hammersley process and are useful for computing last passage percolation values and finding maximal oriented paths. For a class of passage time distributions there is a family of boundary conditions that make the process stationary and reversible. One application is a simple proof of the explicit law of large numbers for last passage percolation with exponential and geometric distributions. Joint with V. Sidoravicius, D. Surgailis, and M. E. Vares.
Following similar analysis to that in Lacoin (PTRF 159, 777-808, 2014), we can show that the quenched critical point for self-avoiding walk on random conductors on the d-dimensional integer lattice is almost surely a constant, which does not depend o
n the location of the reference point. We provide its upper and lower bounds that are valid for all dimensions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
