English
Related papers

Related papers: Self Avoiding Walks, the Language of Science, and …

200 papers

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

Probability · Mathematics 2007-05-23 Jean-Maxime Labarbe , Jean-François Marckert

We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…

Chemical Physics · Physics 2020-01-03 D. S. Grebenkov , J. -F. Rupprecht

We tackle some fundamental problems in probability theory on corrupted random processes on the integer line. We analyze when a biased random walk is expected to reach its bottommost point and when intervals of integer points can be detected…

Machine Learning · Computer Science 2020-03-31 Daniel Berend , Aryeh Kontorovich , Lev Reyzin , Thomas Robinson

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…

Probability · Mathematics 2020-09-17 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

This is an introductory level survey of some topics from a new branch of fractal analysis -- the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of…

Group Theory · Mathematics 2009-04-02 Vadim A. Kaimanovich

A comprehensive numerical study of self-avoiding walks (SAW's) on randomly diluted lattices in two and three dimensions is carried out. The critical exponents $\nu$ and $\chi$ are calculated for various different occupation probabilities,…

Condensed Matter · Physics 2009-10-22 M. D. Rintoul , Jangnyeol Moon , Hisao Nakanishi

Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…

Quantum Physics · Physics 2009-11-07 Todd A. Brun , Hilary A. Carteret , Andris Ambainis

We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…

Probability · Mathematics 2019-10-23 David Croydon , Mark Holmes

We consider a multi-walker generalization of the true self-avoiding walk: the bricklayer model. We perform stochastic simulations, and solve the partial differential equations that describe the collective motion of $N$ bricklayers/walkers…

Statistical Mechanics · Physics 2025-10-14 A. C. Maggs

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

Probability · Mathematics 2026-02-10 Tuan Anh Nguyen , Vitali Wachtel

This article proposes a new way of deriving mean-field exponents for the weakly self-avoiding walk model in dimensions $d>4$. Among other results, we obtain up-to-constant estimates for the full-space and half-space two-point functions in…

Probability · Mathematics 2025-07-28 Hugo Duminil-Copin , Romain Panis

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

Statistical Mechanics · Physics 2012-01-10 Subhash Mahapatra , Prabwal Phukon , Tapobrata Sarkar

We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.

Combinatorics · Mathematics 2016-10-06 Matthew Yancey

We describe some ideas of John Hammersley for proving the existence of critical exponents for two-dimensional self-avoiding walks and provide numerical evidence for their correctness.

Mathematical Physics · Physics 2022-10-07 Anthony J Guttmann , Iwan Jensen

Consider a centred random walk in dimension one with a positive finite variance $\sigma^2$, and let $\tau_B$ be the hitting time for a bounded Borel set $B$ with a non-empty interior. We prove the asymptotic $P_x(\tau_B > n) \sim \sqrt{2 /…

Probability · Mathematics 2014-01-30 Vladislav Vysotsky

We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…

Probability · Mathematics 2016-11-08 Andrey Pilipenko , Vladislav Khomenko

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…

Probability · Mathematics 2017-07-21 Hua-Ming Wang

In this note, we design a discrete random walk on the real line which takes steps $0, \pm 1$ (and one with steps in $\{\pm 1, 2\}$) where at least $96\%$ of the signs are $\pm 1$ in expectation, and which has $\mathcal{N}(0,1)$ as a…

Data Structures and Algorithms · Computer Science 2021-04-15 Yang P. Liu , Ashwin Sah , Mehtaab Sawhney

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

Probability · Mathematics 2007-05-23 L. R. G. Fontes , P. Mathieu

We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on…

Artificial Intelligence · Computer Science 2020-06-16 Pierre Bourhis , Michel Leclère , Marie-Laure Mugnier , Sophie Tison , Federico Ulliana , Lily Galois