Lattice path counting, simple random walk statistics, and randomization: An analytic approach

MaRDI QIDQ4353155zbMATH OpenFDO

Authors Wolfgang Panny, Walter Katzenbeisser

Publication date 1997

zbMATH Keywords

generating functionslattice pathsrandom walks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Sums of independent random variables; random walks (60G50)

Review text

This expository paper presents a unified approach to lattice paths, simple random walks, and so-called randomized random walks. It is based on generating functions and is mainly of an analytical flavor. The leading example is that of the maximum achieved by the walk and the number of times the maximum has been achieved. For the entire collection see [Zbl 0865.00053].

Recommendations

• scientific article; zbMATH DE number 2076939
• On the asymptotic behaviour of the number of maximum points of a simple random walk
• A Generalization of a Random Walk Problem
• Basic analytic combinatorics of directed lattice paths
• Limit laws for basic parameters of lattice paths with unbounded jumps

Cited in

(8)

• Statistics on lattice walks and q-Lassalle numbers
• Probabilities for the passage and time of a random walk in an n-dimensional lattice
• A model of finite-step random walk with absorbent boundaries
• scientific article; zbMATH DE number 2076939 (Why is no real title available?)
• On simple symmetric random walk in d-dimensional integer lattice
• Path Representation of One-Dimensional Random Walks
• scientific article; zbMATH DE number 1405601 (Why is no real title available?)
• Lattice paths inside a table

This page was built for publication: Lattice path counting, simple random walk statistics, and randomization: An analytic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353155)