Related papers: Lattice walks ending on a coordinate hyperplane av…
In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks…
Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one dimensional integer lattice with zero mean, infinite variance and i.i.d. increments $X_n$. We obtain an upper and lower bounds of the potential function, $a(x)$, of…
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.…
We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…
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…
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…
We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of…
The vicious random walker problem on a one dimensional lattice is considered. Many walkers take simultaneous steps on the lattice and the configurations in which two of them arrive at the same site are prohibited. It is known that the…
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…
In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions…
We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…
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…
The Gessel number $P(n,r)$ represents the number of lattice paths in a plane with unit horizontal and vertical steps from $(0,0)$ to $(n+r,n+r-1)$ that never touch any of the points from the set $\{(x,x)\in \mathbb{Z}^2: x \geq r\}$. In…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
Asinowski, Bacher, Banderier and Gittenberger (A. Asinowski, A. Bacher, C. Banderier and B. Gittenberger. Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown…
We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \geq 0, y \geq 0$ of the square-lattice with unit steps in the…
A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…
Recently, several authors have considered lattice paths with various steps, including vertical steps permitted. In this paper, we consider a kind of generalized Motzkin paths, called {\it G-Motzkin paths} for short, that is lattice paths…
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{\frac{\alpha}{2}}$ where $L$ indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with…
In the 1970s, Tutte developed a clever algebraic approach, based on certain "invariants" , to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to…