Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2006

Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area

Résumé

This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on $\mathbb{N}$ with a finite set of jumps). It is a nice surprise (obtained via the "kernel method'') that the generating functions of the moments of the area are algebraic functions, expressible as symmetric functions in terms of the roots of the kernel. For a large class of walks, we give full asymptotics for the average area of excursions ("discrete'' reflected Brownian bridge) and meanders ("discrete'' reflected Brownian motion). We show that drift is not playing any role in the first case. We also generalise previous works related to the number of points below a path and to the area between a path and a line of rational slope.
Fichier principal
Vignette du fichier
dmAG0126.pdf (285.19 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184683 , version 1 (17-08-2015)

Identifiants

Citer

Cyril Banderier, Bernhard Gittenberger. Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.345-356, ⟨10.46298/dmtcs.3481⟩. ⟨hal-01184683⟩
263 Consultations
1566 Téléchargements

Altmetric

Partager

More