Related papers: Generating Functions for Asymmetric Random Walk Pr…
This paper is the first application of the compensation approach to counting problems. We discuss how this method can be applied to a general class of walks in the quarter plane $Z_{+}^{2}$ with a step set that is a subset of…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…
In the field of enumeration of weighted walks confined to the quarter plane, it is known that the generating functions behave very differently depending on the chosen step set; in practice, the techniques used in the literature depend on…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence…
We present the path integral representation of the generating function for classical exclusive particle systems. By introducing hard-core bosonic creation and annihilation operators and appropriate commutation relations, we construct the…
Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…
We consider the subdiffusion--absorption process in a system which consists of two different media separated by a thin membrane. The process is described by subdiffusion--absorption equations with fractional Riemann--Liouville time…
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating…
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…
Lattice paths in the quarter plane have led to a large and varied set of results in recent years. One major project has been the classification of step sets according to the properties of the corresponding generating functions, and this has…
The Lee-Yang theory of adsorbing self-avoiding walks is presented. It is shown that Lee-Yang zeros of the generating function of this model asymptotically accumulate uniformly on a circle in the complex plane, and that Fisher zeros of the…
We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…
We obtain expected number of arrivals, probability of arrival, absorption probabilities and expected time before absorption for a modified discrete random walk on the (sub)set of integers. In a [pqrs] random walk the particle can move one…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching…
We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…
We consider subdiffusion in a system which consists of two media separated by a thin membrane. The subdiffusion parameters may be different in each of the medium. Using the new method presented in this paper we derive the probabilities (the…