Abstract
This paper establishes the asymptotics of a class of random walks on ℕ with regular but unbounded jumps and studies several basic parameters (returns to zero for meanders, bridges, excursions, final altitude for meanders). All these results are generic (obtained by the kernel method for the combinatorial part and by singularity analysis for the asymptotic part).
This paper completes the article [3] which was only dealing with the combinatorics (enumeration and bijections) of walks with unbounded jumps (the so-called “factorial walks”), which play an important role for uniform random generation of some combinatorial objects. We fully parallelize the analytical approach from [4] which was dealing with walks with bounded jumps only.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cyril Banderier. Combinatoire analytique: application aux marches aléatoires. Mémoire de DEA Université Paris VII 1998.
Cyril Banderier. Combinatoire analytique des chemins et des cartes. PhD thesis, Université de Paris 6, 2001.
Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, and Dominique Gouyou-Beauchamps. Generating functions for generating trees. Discrete Mathematics 246 (1–3) :29–55, 2002.
Cyril Banderier and Philippe Flajolet. Basic analytic combinatorics of directed lattice paths. Theoretical Computer Science 281(1–2):37–80, 2002.
Cyril Banderier and Donatella Merlini. Lattice paths with an infinite set of jumps. Proceedings of Formal power series and algebraic combinatorics (Melbourne 2002) 2001.
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, and Renzo Pinzani. A methodology for plane tree enumeration. Discrete Mathematics 180(1–3):4564, 1998.
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, and Renzo Pinzani. Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discrete Mathematics e4 Theoretical Computer Science. DMTCS. An Electronic Journal 4(1):31–44 (electronic), 2000.
Philippe Bougerol and Thierry Jeulin. Brownian bridge on hyperbolic spaces and on homogeneous trees. Probability Theory and Related Fields 115(1):95–120, 1999.
Mireille Bousquet-Mélou and Marko Petkovsek. Linear recurrences with constant coefficients: the multivariate case. Discrete Mathematics 225(1–3):51–75, 2000.
W. G. Brown and W. T. Tutte. On the enumeration of rooted non-separable planar maps. Canad. J. Math. 16:572–577, 1964.
F. R. K. Chung, R. L. Graham, V. E. Hoggatt, and M. Kleiman. The number of Baxter permutations. Journal of Combinatorial Theory Series A, 24:382–394, 1978.
Sylvie Corteel. Séries génératrices exponentielles pour les eco-systèmes signés. InFPSAC’00.Springer, June 2000.
J. Dieudonné. Infinitesimal calculus. Hermann, Paris, 1971. Appendix 3.
S. Dulucq, S. Gire, and J. West. Permutations with forbidden subsequences and nonseparable planar maps. Discrete Mathematics 153(1–3):85–103, 1996.
Guy Fayolle and Roudolf Iasnogorodski. Two coupled processors: the reduction to a Riemann-Hilbert problem. Zeitschrift fuir Wahrscheinlichkeitstheorie und Verwandte Gebiete 47(3):325–351, 1979.
O. Guibert and E. Pergola. Enumeration of vexillary involutions which are equal to their mirror/complement. Discrete Mathematics 224(1–3):281–287, 2000.
Donald Ervin Knuth. The Art of Computer Programming volume 1. Addison-Wesley, third edition, 1997.
Darla Kremer. Permutations with forbidden subsequences and a generalized Schröder number Discrete Mathematics 218(1–3):121–130, 2000.
D. Merlini and M. C. Verri. Generating trees and proper Riordan Arrays. Discrete Mathematics 218:167–183, 2000.
[] Donatella Merlini, Renzo Sprugnoli, and Maria Cecilia Verri. An algebra for generating trees. In Mathematics and computer science (Versailles 2000) pages 127–139, Basel, 2000. Birkhäuser.
A. M. Odlyzko. Asymptotic enumeration methods volume II. Elsevier, 1995. In Handbook of Combinatorics, (R. Graham, M. Grötschel, and L. Lovász, eds.).
Elisa Pergola, Renzo Pinzani, and Simone Rinaldi. Towards an algebra of succession rules. In Mathematics and computer science (Versailles 2000 ), pages 141–152, Basel, 2000. Birkhäuser.
Elisa Pergola and Robert A. Sulanke. Schröder triangles, paths, and parallelogram polyominoes. Journal of Integer Sequences, 1:Article 98.1–7, 1998.
Jim Pitman. Brownian motion, bridge, excursion, and meander characterized by sampling at independent uniform times. Electronic Journal of Probability 4:no. 11, 33 pp. (electronic), 1999.
J. West. Generating trees and the Catalan and Schröder numbers. Discrete Mathematics 146:247–262, 1995.
J. West. Generating trees and forbidden subsequences. Discrete Mathematics 157:363–374, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Basel AG
About this paper
Cite this paper
Banderier, C. (2002). Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps. In: Chauvin, B., Flajolet, P., Gardy, D., Mokkadem, A. (eds) Mathematics and Computer Science II. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8211-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8211-8_2
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9475-3
Online ISBN: 978-3-0348-8211-8
eBook Packages: Springer Book Archive