Related papers: A Reflection Principle for Three Vicious Walkers
The orbit-sum method is an algebraic version of the reflection-principle that was introduced by Bousquet-M\'{e}lou and Mishna to solve functional equations that arise in the enumeration of lattice walks with small steps restricted to…
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…
We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…
In recent preprints, Cigler considered certain Hankel determinants of convoluted Catalan numbers and conjectured identities for these determinants. In this note, we shall give a bijective proof of Cigler's Conjecture by interpreting…
In this expository note, we give a short derivation of the expected number of collisions between two independent simple random walkers on integer lattices. Adapting a Poissonization technique introduced by Lange, we express the collision…
The enumeration of quarter-plane lattice walks with small steps is a classical problem in combinatorics. An effective approach is the kernel method, where the solution is derived by positive term extraction. Alternatively, one may reduce…
We consider N vicious walkers moving in one dimension in a one-body potential v(x). Using the backward Fokker-Planck equation we derive exact results for the asymptotic form of the survival probability Q(x,t) of vicious walkers initially…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles…
Around 2000, Ira Gessel conjectured that the number of lattice walks in the quadrant N^2, starting and ending at the origin (0,0) and taking their steps in {E,NE,W,SW} had a simple hypergeometric form. In the following decade, this problem…
We consider lattice walks in the plane starting at the origin, remaining in the first quadrant and made of West, South and North-East steps. In 1965, Germain Kreweras discovered a remarkably simple formula giving the number of these walks…
We aim to describe a droplet bouncing on a vibrating bath using a simple and highly versatile model inspired from quantum mechanics. Close to the Faraday instability, a long-lived surface wave is created at each bounce, which serves as a…
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…
This work considers lattice walks restricted to the quarter plane, with steps taken from a set of cardinality three. We present a complete classification of the generating functions of these walks with respect to the classes algebraic,…
Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…
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…
More than 15 years ago Guttmann and V\"oge [J. Statist. Plann. Inference, {\bf 101}, 107 (2002)], introduced a model of friendly walkers. Since then it has remained unsolved. In this paper we provide the exact solution to a closely allied…
We consider the diffusion scaling limit of the vicious walker model that is a system of nonintersecting random walks. We prove a functional central limit theorem for the model and derive two types of nonintersecting Brownian motions, in…
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,…
A one-dimensional system of nonintersecting Brownian particles is constructed as the diffusion scaling limit of Fisher's vicious random walk model. $N$ Brownian particles start from the origin at time $t=0$ and undergo mutually avoiding…