相关论文: Self Avoiding Walks in Four Dimensions: Logarithmi…

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

This paper proves the formula \nu(d) =1 for d=1 and \nu(d) = max(1/4 +1/d, 1/2) for d > 1 for the root mean square displacement exponent \nu(d) of the self-avoiding walk (SAW) in Z^d, and thus, resolves some major long-standing open…

We study the problem of a random walk on a lattice in which bonds connecting nearest neighbor sites open and close randomly in time, a situation often encountered in fluctuating media. We present a simple renormalization group technique to…

Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…

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 study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…

For a random walk in an elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying the a ballisticity condition slightly weaker than condition (T'), We consider the probability of linear slowdown. We show an…

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that…

We consider the Nonlinear-Cost Random Walk model in discrete time introduced in [Phys. Rev. Lett. 130, 237102 (2023)], where a fee is charged for each jump of the walker. The nonlinear cost function is such that slow/short jumps incur a…

It is shown that self avoiding walk on the seven regular infinite planar triangulation has linear expected displacement.

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

Expressions for scaling limits of random walks, such as those obtained in several areas of the Probability theory literature, are of great significance in characterizing long term, stationary behavior of random processes. Presumably, in the…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

We present general algorithms (fully implemented in Maple) for calculations of various quantities related to constrained directed walks for a general set of steps on the square lattice in two dimensions. As a special case, we rederive…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. As one of the main results, we obtain a hypergeometric…

The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…

In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.