Related papers: Scaling of loop-erased walks in 2 to 4 dimensions

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)}$.…

We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…

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…

Sharp estimates for the length of loop erased random walk between two vertices on the [n]^d -torus, d > 4, are established. The mean length is order n^{d/2} . In dimension 4 we have only an upper bound.

We prove that the susceptibility of the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the critical dimension $d=4$, has a logarithmic correction to mean-field scaling behaviour as the critical point is approached, with…

We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…

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…

We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…

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 how to extract the scaling behavior of quantum walks using the renormalization group (RG). We introduce the method by efficiently reproducing well-known results on the one-dimensional lattice. As a nontrivial model, we apply this…

We give evidence that the functional renormalization group (FRG), developed to study disordered systems, may provide a field theoretic description for the loop-erased random walk (LERW), allowing to compute its fractal dimension in a…

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 probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…

We have studied the probability distribution of the perimeter and the area of the k-th largest erased-loop in loop-erased random walks in two-dimensions for k = 1 to 3. For a random walk of N steps, for large N, the average value of the…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…

In this work we consider loop-erased random walk (LERW) and its scaling limit in three dimensions, and prove that 3D LERW parametrized by renormalized length converges to its scaling limit parametrized by some suitable measure with respect…

The $n$-vector spin model, which includes the self-avoiding walk (SAW) as a special case for the $n \rightarrow 0 $ limit, has an upper critical dimensionality at four spatial dimensions (4D). We simulate the SAW on 4D hypercubic lattices…

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…

We present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…