Related papers: Transforming fixed-length self-avoiding walks into…

Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…

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…

We consider a self-avoiding walk model (SAW) on the faces of the square lattice $\mathbb{Z}^2$. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square…

We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…

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 paper concerns a scaling limit of a one-dimensional random walk $S^x_n$ started from $x$ on the integer lattice conditioned to avoid a non-empty finite set $A$, the random walk being assumed to be irreducible and have zero mean.…

We compute the lattice 1-site probabilities, on the upper half-plane, of the four height variables in the two-dimensional Abelian sandpile model. We find their exact scaling form when the insertion point is far from the boundary, and when…

We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…

We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…

The scaling limit of the spin cluster boundaries of the Ising model with domain wall boundary conditions is SLE with kappa=3. We hypothesise that the three-state Potts model with appropriate boundary conditions has spin cluster boundaries…

We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent $\nu$ are obtained. They are in…

We prove that, for $\kappa\le 4$, backward chordal SLE$_\kappa$ admits backward chordal SLE$_\kappa(-4,-4)$ decomposition for the capacity parametrization. This means that, for any bounded measurable subset $U\subset Q_4:={\mathbb…

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched…

In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…

We show that when observing the range of a chordal SLE$_\kappa$ curve for $\kappa \in (4,8)$, it is not possible to recover the order in which the points have been visited. We also derive related results about conformal loop ensembles…

We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…

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…

Sparse autoencoders (SAEs) decompose transformer residual streams into interpretable feature dictionaries, yet the relationship between SAE width and causal influence on model output has not been systematically characterised. We introduce…

We characterize and describe all random subsets $K$ of a given simply connected planar domain (the upper half-plane $\H$, say) which satisfy the ``conformal restriction'' property, i.e., $K$ connects two fixed boundary points (0 and…