A probabilistic method for lattice path enumeration
From MaRDI portal
Publication:1081604
DOI10.1016/0378-3758(86)90009-1zbMath0602.05006OpenAlexW2079699338MaRDI QIDQ1081604
Publication date: 1986
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(86)90009-1
Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (31)
Walks confined in a quadrant are not always D-finite ⋮ Bijective counting of Kreweras walks and loopless triangulations ⋮ Counting quadrant walks via Tutte's invariant method ⋮ An elementary solution of Gessel's walks in the quadrant ⋮ Weighted lattice walks and universality classes ⋮ On the functions counting walks with small steps in the quarter plane ⋮ Percolation on Triangulations: A Bijective Path to Liouville Quantum Gravity ⋮ Counting walks in a quadrant: a unified approach via boundary value problems ⋮ Extension of certain types of generating relations ⋮ The quasi-holonomic ansatz and restricted lattice walks ⋮ Size of downsets in the pushing order and a problem of Berlekamp ⋮ On 3-dimensional lattice walks confined to the positive octant ⋮ Random walks with absorbing points ⋮ Lattice path counting and the theory of queues ⋮ A history and a survey of lattice path enumeration ⋮ The complete generating function for Gessel walks is algebraic ⋮ Walks in the quarter plane: Kreweras' algebraic model ⋮ Promotion of Kreweras words ⋮ Counting quadrant walks via Tutte's invariant method (extended abstract) ⋮ Hypergeometric expressions for generating functions of walks with small steps in the quarter plane ⋮ Counting walks with large steps in an orthant ⋮ Classifying lattice walks restricted to the quarter plane ⋮ Square lattice walks avoiding a quadrant ⋮ Lattice and Schröder paths with periodic boundaries ⋮ Promotion of Kreweras words ⋮ Exchange relations, Dyck paths and copolymer adsorption ⋮ Exact solution of some quarter plane walks with interacting boundaries ⋮ Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior ⋮ Adsorbing staircase walks and staircase polygons ⋮ Size of Downsets in the Pushing Order and a Problem of Berlekamp ⋮ Lattice paths not touching a given boundary
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ballot problem with three candidates
- Recurrence of a random walk on the halfline as the generating function for the Catalan numbers
- Solution of an enumerative problem connected with lattice paths
- Simple Random Walk and Rank Order Statistics
- Random Walk and Distributions of Rank Order Statistics
This page was built for publication: A probabilistic method for lattice path enumeration