Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 4:22:37 PM
Last modification on : Wednesday, October 27, 2021 - 2:52:26 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 10:44:19 AM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads