Related papers: Correction-to-scaling exponents for two-dimensiona…
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
We describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process…
We prove several rigorous results about the asymptotic behaviour of the numbers of polygons and self-avoiding walks confined to a square on the square lattice. Specifically we prove that the dominant asymptotic behaviour of polygons…
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 $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
We prove a bound on the finite sample error of sequential Monte Carlo (SMC) on static spaces using the $L_2$ distance between interpolating distributions and the mixing times of Markov kernels. This result is unique in that it is the first…
We present computer simulations of anomalous diffusion, $< r^2(t) > \sim a t^{1-\delta}$, in two dimensions. The Monte Carlo calculations are in excellent agreement with previous renormalization group calculations. Interestingly, use of a…
We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…
Recently, a Monte Carlo method has been presented which allows for the form-free retrieval of size distributions from isotropic scattering patterns, complete with uncertainty estimates linked to the data quality. Here, we present an…
We show numerically that critical exponents for two-point interchain correlation of an infinite chain characterize those of finite chains in Self-Avoiding Walk (SAW) and Self-Avoiding Polygon (SAP) under a topological constraint. We…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the critical point, and prove an upper bound…
We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…
This article presents SAWdoubler, a package for counting the total number Z(N) of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic concept has been published previously by us. We discuss an…
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…
With extensive Monte Carlo simulations, we present high-precision estimates of the critical exponents of branching annihilating random walks with two offspring, a prototypical model of the directed Ising universality class in one dimension.…
We present a Monte Carlo study of the one-component $\phi^4$ model on the cubic lattice in three dimensions. Leading order scaling corrections are studied using the finite size scaling method. We compute the corrections to scaling exponent…
Monte Carlo (MC) simulations have been performed to refine the estimation of the correction-to-scaling exponent $\omega$ in the 2D $\varphi^4$ model, which belongs to one of the most fundamental universality classes. If corrections have the…