Related papers: Loop-erased random walk on a torus in dimensions 4…

Let x and y be points chosen uniformly at random from $\Z_n^4$, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order $n^2 (\log n)^{1/6}$, resolving a…

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in $d=4$,…

Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…

We measure the fractal dimension of loop-erased random walk (LERW) in 3 dimensions, and estimate that it is 1.62400 +- 0.00005. LERW is closely related to the uniform spanning tree and the abelian sandpile model. We simulated LERW on both…

The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW…

We show that in the loop-erased random walk problem, the exponent characterizing probability distribution of areas of erased loops is superuniversal. In d-dimensions, the probability that the erased loop has an area A varies as A^{-2} for…

Let $S = (S(n))$ be a simple random walk on $\mathbb{Z}^{d}$ started at the origin. We study a loop-erasing procedure of $S[0,n]$ that differs from Lawler's chronological loop-erasure. Specifically, we remove loops from $S[0,n]$ in…

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…

We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.

We consider a simple random walk on $\mathbb{Z}^d$ started at the origin and stopped on its first exit time from $(-L,L)^d \cap \mathbb{Z}^d$. Write $L$ in the form $L = m N$ with $m = m(N)$ and $N$ an integer going to infinity in such a…

We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…

Consider the subgraph of the discrete $d$-dimensional torus of size length $N$, $d\ge3$, induced by the range of the simple random walk on the torus run until the time $uN^d$. We prove that for all $d\ge 3$ and $u>0$, the mixing time for…

We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…

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…

We present high statistics simulation data for the average time $\langle T_{\rm cover}(L)\rangle$ that a random walk needs to cover completely a 2-dimensional torus of size $L\times L$. They confirm the mathematical prediction that $\langle…

We study the capacity of loop-erased random walk (LERW) on $\mathbb{Z}^d$. For $d\geq4$, we prove a strong law of large numbers and give explicit expressions for the limit in terms of the non-intersection probabilities of a simple random…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

We study the scaling properties of long-range loop-erased random walks (LR-LERW), where the underlying random walker performs L\'evy-flight-like jumps with a power-law step-length distribution $P(\mathbf{r})\sim |\mathbf{r}|^{-(d+\sigma)}$.…