English
Related papers

Related papers: Quantitative sub-ballisticity of self-avoiding wal…

200 papers

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

Probability · Mathematics 2017-06-19 Alain-Sol Sznitman

For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…

Probability · Mathematics 2019-10-04 Chak Hei Lo , Andrew R. Wade

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Probability · Mathematics 2024-07-10 Daniela Bertacchi , Elisabetta Candellero , Fabio Zucca

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

Probability · Mathematics 2013-12-06 Markus Heydenreich , Remco van der Hofstad , Tim Hulshof

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

Probability · Mathematics 2018-11-06 Jian Ding , Changji Xu

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…

Disordered Systems and Neural Networks · Physics 2009-11-10 Carlos P. Herrero

We consider the boundary case (in the sense of Biggins and Kyprianou [Electron. J. Probab. 10 (2005) 609--631] in a one-dimensional super-critical branching random walk, and study the additive martingale $(W_n)$. We prove that, upon the…

Probability · Mathematics 2014-04-07 Elie Aidekon , Zhan Shi

The time it takes a random walker in a lattice to reach the origin from another vertex $x$, has infinite mean. If the walker can restart the walk at $x$ at will, then the minimum expected hitting time $T(x,0)$ (minimized over restarting…

Probability · Mathematics 2010-05-25 Svante Janson , Yuval Peres

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 study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent, and the number of rooted open walks W_n(S), and rooted…

Statistical Mechanics · Physics 2009-11-11 Sumedha , Deepak Dhar

Given $d\geq2$, we construct a Zariski-dense random walk on the space of lattices SL$_d(\mathbb{R})/$SL$_d(\mathbb{Z})$ that exhibits escape of mass. This negates the suggestion of recurrence made by Benoist [Ben14] (ICM 2014) and by…

Probability · Mathematics 2025-04-16 Axel Péneau , Cagri Sert

We study the biased random walk in positive random conductances on $\mathbb {Z}^d$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite…

Probability · Mathematics 2013-12-16 Alexander Fribergh

We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that \mu = 4.684 039 931(27). Our method also provides…

Statistical Mechanics · Physics 2015-04-09 Nathan Clisby

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise…

Probability · Mathematics 2026-04-10 Jose Blanchet , Zhenyuan Zhang

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

Probability · Mathematics 2020-12-24 Kohei Uchiyama

We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…

Probability · Mathematics 2015-12-31 Bartosz Trojan

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4,…

Geometric Topology · Mathematics 2019-06-04 Konstantin Golubev , Amitay Kamber

Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…

Probability · Mathematics 2013-06-27 Hubert Lacoin

In this paper, we address an extension of the theory of self-concordant functions for a manifold. We formulate the self-concordance of a geodesically convex function by a condition of the covariant derivative of its Hessian, and verify that…

Optimization and Control · Mathematics 2023-04-18 Hiroshi Hirai

This paper proves the long-standing open conjecture rooted in chemical physics (Flory (1949)) that the self-avoiding walk (SAW) in the square lattice has root mean square displacement exponent \nu= 3/4. This value is an instance of the…

Probability · Mathematics 2007-05-23 Irene Hueter