English
Related papers

Related papers: A generalised inductive approach to the lace expan…

200 papers

We study a class of $d$-dimensional random walks, including the two-dimensional simple random walk, reweighted by a self-repelling Gibbsian pair potential. We prove lower bounds on the diffusion constant for short-range interactions, and…

Probability · Mathematics 2026-02-17 Tobias Schmidt , Mark Sellke

Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…

Statistical Mechanics · Physics 2023-02-21 Dušanka Marčetić

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

Probability · Mathematics 2025-07-08 Viet Hung Hoang , Kilian Raschel

We prove that nearest-neighbor percolation in dimensions $d\geq 11$ displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the percolation triangle diagram. The finiteness of the triangle…

Probability · Mathematics 2017-03-24 Robert Fitzner , Remco van der Hofstad

The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…

Analysis of PDEs · Mathematics 2019-01-01 Lianzhang Bao , Zhengfang Zhou

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…

Statistical Mechanics · Physics 2020-09-23 Wyatt Hooper , Alexander R. Klotz

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…

Disordered Systems and Neural Networks · Physics 2009-11-13 Viktoria Blavatska , Wolfhard Janke

This is a short review of the two papers on the $x$-space asymptotics of the critical two-point function $G_{p_c}(x)$ for the long-range models of self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$, defined by the…

Mathematical Physics · Physics 2019-10-23 Akira Sakai

The purpose of this note is twofold. First, we survey the study of the percolation phase transition on the Hamming hypercube {0,1}^m obtained in the series of papers [9,10,11,24]. Secondly, we explain how this study can be performed without…

Probability · Mathematics 2012-11-01 Remco van der Hofstad , Asaf Nachmias

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…

Probability · Mathematics 2014-03-04 Noam Berger

Consider the long-range models on $\mathbb{Z}^d$ of random walk, self-avoiding walk, percolation and the Ising model, whose translation-invariant 1-step distribution/coupling coefficient decays as $|x|^{-d-\alpha}$ for some $\alpha>0$. In…

Mathematical Physics · Physics 2019-03-27 Lung-Chi Chen , Akira Sakai

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

Statistical Mechanics · Physics 2015-06-19 Denis Boyer , Citlali Solis-Salas

We study an asymptotic expansion of the critical point for the nearest-neighbor oriented percolation on $\mathbb Z^d$ in powers of $d^{-1}$ as $d\rightarrow \infty$. The proof relies heavily on the lace expansion.

Probability · Mathematics 2025-08-19 Noe Kawamoto

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

Probability · Mathematics 2025-04-22 Youssef Lazar

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

Statistical Mechanics · Physics 2015-06-24 Timo Aspelmeier , Jérôme Magnin , Willi Graupner , Uwe C. Täuber

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

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…

Statistical Mechanics · Physics 2015-06-22 Niklas Fricke , Wolfhard Janke

The effect of rotational constraint on the properties of lattice models like the self-avoiding walk, lattice animals and percolation is discussed. The results obtained so far, using a variety of exact and approximate techniques, are…

Statistical Mechanics · Physics 2008-02-03 Indrani Bose

We consider self-avoiding walks (SAWs) on the backbone of percolation clusters in space dimensions d=2, 3, 4. Applying numerical simulations, we show that the whole multifractal spectrum of singularities emerges in exploring the…

Disordered Systems and Neural Networks · Physics 2009-11-13 Viktoria Blavatska , Wolfhard Janke

We study a percolation model on $\mathbb R^d$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|^{-(d-2)}$ as $|x| \to \infty$, with…

Probability · Mathematics 2026-05-28 Matthew Dickson , Yucheng Liu