Related papers: On the scaling limit of planar self-avoiding walk

A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…

We consider the phase diagram of self-avoiding walks (SAW) on the simple cubic lattice subject to surface and bulk interactions, modeling an adsorbing surface and variable solvent quality for a polymer in dilute solution, respectively. We…

We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…

We consider a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses…

We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…

Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…

We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…

We consider quadrangulations with a boundary and derive explicit expressions for the generating functions of these maps with either a marked vertex at a prescribed distance from the boundary, or two boundary vertices at a prescribed mutual…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

In our previous work, we defined a prime walk (PW) on a square grid and presented several intriguing numerical results. Here, we demonstrate the main conjecture presented there, namely, that the area covered by the prime walk is unbounded.…

We analyze new data for self-avoiding polygons, on the square and triangular lattices, enumerated by both perimeter and area, providing evidence that the scaling function is the logarithm of an Airy function. The results imply universal…

A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…

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…

This paper concerns a random walk on a planar graph and presents certain estimates concerning the harmonic measures for the walk in a grid domain which estimates are useful for showing the convergence of a LERW (loop-erased random walk) to…

For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…

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…

For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…

The critical behaviour of directed self-avoiding walks is studied on parabolic-like systems with a free boundary at x=\pm Ct^\alpha. Using a scaling argument, 1/C is shown to be a marginal variable when \alpha=\nu_\perp/\nu_\parallel=1/2,…