English
Related papers

Related papers: Supercritical self-avoiding walks are space-fillin…

200 papers

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

Dynamical Systems · Mathematics 2022-10-18 Timothée Bénard

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh

We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…

Probability · Mathematics 2015-05-19 Ben Dyhr , Michael Gilbert , Tom Kennedy , Gregory F. Lawler , Shane Passon

We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…

Mathematical Physics · Physics 2019-11-26 Youjin Deng , Timothy M Garoni , Jens Grimm , Abrahim Nasrawi , Zongzheng Zhou

We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…

Mathematical Physics · Physics 2022-12-23 Anthony J Guttmann , Iwan Jensen , Aleksander L Owczarek

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

Probability · Mathematics 2014-05-16 Daiwei He

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

Probability · Mathematics 2025-02-06 Giulio Iacobelli , Guilherme Ost , Daniel Y. Takahashi

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…

Statistical Mechanics · Physics 2009-11-07 Aleksander L. Owczarek , Thomas Prellberg

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…

Probability · Mathematics 2019-10-30 Philippe Carmona , Nicolas Pétrélis

This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…

Probability · Mathematics 2018-12-11 Alan Hammond , Tyler Helmuth

We consider the critical behaviour of the continuous-time weakly self-avoiding walk with contact self-attraction on $\mathbb{Z}^4$, for sufficiently small attraction. We prove that the susceptibility and correlation length of order $p$ (for…

Mathematical Physics · Physics 2020-04-28 Roland Bauerschmidt , Gordon Slade , Benjamin C. Wallace

For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…

Probability · Mathematics 2013-06-18 Johan S. H. van Leeuwaarden , Kilian Raschel

The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…

Statistical Mechanics · Physics 2009-11-13 A. L. Owczarek , T. Prellberg

We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…

Probability · Mathematics 2007-05-23 Amine Asselah , Fabienne Castell

We study the once-reinforced random walk on $\mathbb Z^d$, which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that the walk is transient when $d\ge 6$ and when the reinforcement…

Probability · Mathematics 2026-01-27 Dor Elboim , Gady Kozma

We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…

Statistical Mechanics · Physics 2009-10-31 Helge Frauenkron , Maria Serena Causo , Peter Grassberger

The paper deals with the asymptotic properties of a symmetric random walk in a high contrast periodic medium in $\mathbb Z^d$, $d\geq 1$. We show that under proper diffusive scaling the random walk exhibits a non-standard limit behaviour.…

Probability · Mathematics 2017-10-25 Andrey Piatnitski , Elena Zhizhina

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Probability · Mathematics 2018-11-20 Julien Brémont

It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…

Mathematical Physics · Physics 2015-06-16 Anthony J. Guttmann , Jesper L. Jacobsen

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…

Probability · Mathematics 2007-05-23 Gregory F. Lawler , Oded Schramm , Wendelin Werner