English
Related papers

Related papers: Powers of 2 in High-Dimensional Lattice Walks

200 papers

A lattice path in $\mathbb{Z}^d$ is a sequence $\nu_1,\nu_2,\ldots,\nu_k\in\mathbb{Z}^d$ such that the steps $\nu_i-\nu_{i-1}$ lie in a subset $\mathbf{S}$ of $\mathbb{Z}^d$ for all $i=2,\ldots,k$. Let $T_{m,n}$ be the $m\times n$ table in…

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…

High Energy Physics - Lattice · Physics 2008-11-26 A R Conway , I G Enting , A J Guttmann

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 S be a subset of {-1,0,1}^2 not containing (0,0). We address the enumeration of plane lattice walks with steps in S, that start from (0,0) and always remain in the first quadrant. A priori, there are 2^8 problems of this type, but some…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Marni Mishna

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

Statistical Mechanics · Physics 2009-11-11 G. Oshanin , R. Voituriez , S. Nechaev , O. Vasilyev , F. Hivert

We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…

Combinatorics · Mathematics 2021-05-28 James East , Nicholas Ham

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

Probability · Mathematics 2019-04-30 Andrea Collevecchio , Kais Hamza , Laurent Tournier

We study Hamiltonian walks (HWs) on the family of three--dimensional modified Sierpinski gasket fractals, as a model for compact polymers in nonhomogeneous media in three dimensions. Each member of this fractal family is labeled with an…

Statistical Mechanics · Physics 2010-02-26 Dušanka Lekić , Sunčica Elezović-Hadžić

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…

Probability · Mathematics 2018-08-30 Alan Hammond

Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…

Probability · Mathematics 2021-06-09 Zhi-qiang Gao

We consider Gessel walks in the plane starting at the origin $(0, 0)$ remaining in the first quadrant $i, j \geq 0$ and made of West, North-East, East and South-West steps. Let $F(m; n_1, n_2)$ denote the number of these walks with exact…

Combinatorics · Mathematics 2009-03-03 Sun Ping

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

Probability · Mathematics 2019-05-21 Bastien Mallein , Piotr Miłoś

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

Combinatorics · Mathematics 2016-08-10 Simão Herdade , Van Vu

We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…

Combinatorics · Mathematics 2019-05-09 Stephen Melczer , Mark C. Wilson

Let $(X,d)$ be a geodesic Gromov-hyperbolic space, $o \in X$ a basepoint and $\mu$ a countably supported non-elementary probability measure on $\operatorname{Isom}(X)$. Denote by $z_n$ the random walk on $X$ driven by the probability…

Probability · Mathematics 2022-03-15 Richard Aoun , Pierre Mathieu , Cagri Sert

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…

Statistical Mechanics · Physics 2021-03-17 Tushar Mitra , Tomal Hossain , Santo Banerjee , Md. Kamrul Hassan

We consider the $n$-component $|\varphi|^4$ lattice spin model ($n \ge 1$) and the weakly self-avoiding walk ($n=0$) on $\mathbb{Z}^d$, in dimensions $d=1,2,3$. We study long-range models based on the fractional Laplacian, with spin-spin…

Mathematical Physics · Physics 2017-12-06 Martin Lohmann , Gordon Slade , Benjamin C. Wallace

Let $\mathcal{L}_n$ denote the set of all paths from $[0,0]$ to $[n, n]$ which consist of either unit north steps $N$ or unit east steps $E$ or, equivalently, the set of all words $L \in \{E,N\}^*$ with $n$ $E$'s and $n$ $N$'s. Given $L \in…

Combinatorics · Mathematics 2017-08-25 Ran Pan , Jeffrey B. Remmel

The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…

Statistical Mechanics · Physics 2016-11-03 Iwan Jensen

We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…

Combinatorics · Mathematics 2014-11-25 Paul RG Mortimer , Thomas Prellberg