Related papers: Walks on the slit plane: other approaches

We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…

A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…

Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…

We extend the classification of nearest neighbour walks in the quarter plane to models in which multiplicities are attached to each direction in the step set. Our study leads to a small number of infinite families that completely…

This is the second of two papers on the end-to-end distance of a weakly self-repelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log…

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…

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…

We show that the generating function (in n) for the number of walks on the square lattice with steps (1,1), (1,-1), (2,2) and (2,-2) from (0,0) to (2n,0) in the region 0 <= y <= w satisfies a very special fifth order nonlinear recurrence…

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

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…

We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…

We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…

The special limit of the totally asymmetric zero range process of the low-dimensional non-equilibrium statistical mechanics described by the non-Hermitian Hamiltonian is considered. The calculation of the conditional probabilities of the…

This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.

The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…

This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…

We consider a self-avoiding walk model (SAW) on the faces of the square lattice $\mathbb{Z}^2$. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square…

We consider singular (aka genus $0$) walks in the quarter plane and their associated generating functions $Q(x,y,t)$, which enumerate the walks starting from the origin, of fixed endpoint (encoded by the spatial variables $x$ and $y$) and…