Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRandom walk on the randomly-oriented Manhattan lattice
82
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 fixed 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.
rate research
Read More
We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0<p<1$. A particle is moving on the edges with unit speed following the orientation of the lattice and it will turn only when encountering an obstruction. The problem is that for which value of $p$ is the trajectory of the particle closed almost surely. We prove this for $p>frac{1}{2}-varepsilon$ with some $varepsilon>0$.
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 presence 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.
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 on the location of the reference point. We provide its upper and lower bounds that are valid for all dimensions.
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 random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-alpha}$ with $alpha>0$. For random walk in any dimension $d$ and for self-avoiding walk and critical/subcritical oriented percolation above the common upper-critical dimension $d_{mathrm{c}}equiv2(alphawedge2)$, we prove large-$t$ asymptotics of the gyration radius, which is the average end-to-end distance of random walk/self-avoiding walk of length $t$ or the average spatial size of an oriented percolation cluster at time $t$. This proves the conjecture for long-range self-avoiding walk in [Ann. Inst. H. Poincar{e} Probab. Statist. (2010), to appear] and for long-range oriented percolation in [Probab. Theory Related Fields 142 (2008) 151--188] and [Probab. Theory Related Fields 145 (2009) 435--458].
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
