Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2006_special_252_a5,
     author = {Banderier, Cyril and Gittenberger, Bernhard},
     title = {Analytic {Combinatorics} of {Lattice} {Paths:} {Enumeration} and {Asymptotics} for the {Area}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities},
     year = {2006},
     doi = {10.46298/dmtcs.3481},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3481/}
}
TY  - JOUR
AU  - Banderier, Cyril
AU  - Gittenberger, Bernhard
TI  - Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3481/
DO  - 10.46298/dmtcs.3481
LA  - en
ID  - DMTCS_2006_special_252_a5
ER  - 
%0 Journal Article
%A Banderier, Cyril
%A Gittenberger, Bernhard
%T Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area
%J Discrete mathematics & theoretical computer science
%D 2006
%V DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3481/
%R 10.46298/dmtcs.3481
%G en
%F DMTCS_2006_special_252_a5
Banderier, Cyril; Gittenberger, Bernhard. Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006). doi : 10.46298/dmtcs.3481. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3481/

Cité par Sources :