Random maps, coalescing saddles, singularity analysis, and airy phenomena

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 194-246

  Banderier, Cyril ^a   Flajolet, Philippe ^a   Schaeffer, Gilles ^b   Soria, Michèle ^c  

^a INRIA ROCQUENCOURT   (France)

^b LORIA   (France)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Airy function; Analytic combinatorics; Coalescing saddle points; Multiconnectivity; Planar map; Random generation; Random graph; Singularity analysis; Stable law

Indexed keywords

EID: 0035539862     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10021     Document Type: Article

References (54)

1. M. Abramowitz and I.A. Stegun, Handhook of mathematical functions, Dover, New York 1973. [A reprint of the tenth National Bureau of Standards edition, 1964].
2. C. Banderier, P. Flajolet, G. Schaeffer, and M. Soria, "Planar maps and Airy phenomena," Automata, languages, and programming (2000), E.W.U. Montanari, J. Rolim (Editors), Lecture Notes in Computer Science, 1853, pp. 388-402, Proceedings of the 27th ICALP Conference, Geneva, July 2000.
3. C.M. Bender, and S.A. Orszag, Advanced mathematical methods for scientists and engineers. I. Springer-Verlag, New York, 1999. [Asymptotic methods and perturbation theory, Reprint of the 1978 original].
4. E.A. Bender, Central and local limit theorems applied to asymptotic enumeration, J Combin Theory 15 (1973), 91-111.
5. E.A. Bender, Asymptotic methods in enumeration. SIAM Review 16(4) (1974), 485-515.
6. E.A. Bender, Some unsolved problems in map enumeration. Bull Inst Combin Appl 3 (1991), 51-56.
7. E.A. Bender, L.B. Richmond, and N.C. Wormald, Largest 4-connected components of 3-connected planar triangulations. Rand Struct Alg 7(4) (1995), 273-285.
8. N. Bleistein, and R.A Handelsman, Asymptotic Expansions of Integrals. Dover, New York, 1986. [A reprint of the second Holt, Rinehart and Winston edition, 1975].
9. R. Bo and R. Wong, Uniform asymptotic expansion of Charlier polynomials, Meth Appl Anal 1(3) (1994), 294-313.
10. B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim, and D.B. Wilson, The scaling window of the 2-SAT transition, Rand Struct Alg 18(3) (2001), 201-256.
11. M. Bousquet-Mélou and G. Schaeffer, Enumeration of planar constellations, Adv Appl Math 24(4) (2000), 337-368.
12. L. Breiman, Probability, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992. [Corrected reprint of the 1968 original].
13. N.G. De Bruijn, Asymptotic methods in analysis, Dover, New York 1981. [A reprint of the third North Holland edition, 1970 (first edition, 1958)].
14. M. Drmota and M. Soria, Images and preimages in random mappings, SIAM J Discrete Math 10(2) (1997), 246-269.
15. P. Duchon, Q-grammars and wall polyominoes, Ann Combin 3 (1999), 311-321.
16. R. Durrett, Probability: Theory and examples, 2nd ed. Duxbury Press, Belmont, CA, 1996.
17. A. Erdélyi, Higher transcendental functions, 2nd ed., vols. 1-3, Krieger Malabar, FL, 1981.
18. W. Feller, An introduction to probability theory and its applications, 2nd ed. vol. II, Wiley, New York, 1971.
19. P. Flajolet, Singularity analysis and asymptotics of Bernoulli sums, Theor Comput Sci 215(1/2) (1999), 371-381.
20. P. Flajolet, D.E. Knuth, and B. Pittel, The first cycles in an evolving graph, Discrete Math 75 (1989), 167-215.
21. P. Flajolet and G. Louchard, Analytic variations on the Airy distribution, Technical Report TR-01-15, Alcom-FT Project, 2001. [To appear in Algorithmica, Special Issue on Analysis of Algorithms 2002; 16p].
22. P. Flajolet and G. Louchard, Analytic variations on the Airy distribution, Technical Report TR-01-15, Alcom-FT Project, 2001. [To appear in Algorithmica, Special Issue on Analysis of Algorithms 2002; 16p].
23. P. Flajolet and A.M. Odlyzko, Singularity analysis of generating functions, SIAM J Applied Math 3(2) (1990), 216-240.
24. P. Flajolet P. Poblete, and A. Viola, On the analysis of linear probing hashing, Algorithmica 22(4) (1998), 490-515.
25. P. Flajolet, B. Salvy, and G. Schaeffer, Airy phenomena and analytic combinatorics of connected graphs, Research report, Institut National de Recherche en Informatique et en Automatique, 2001, in preparation.
26. P. Flajolet and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Math 114 (1993), 159-180.
27. C.L. Frenzen and R. Wong, Uniform asymptotic expansions of Laguerre polynomials, SIAM J Math Anal 19(5) (1988), 1232-1248.
28. Z. Gao and N.C. Wormald, The size of the largest components in random planar maps, SIAM J Discrete Math 12(2) (1999), 217-228 (electronic).
29. D. Gardy, Some results on the asymptotic behaviour of coefficients of large powers of functions, Discrete Math 139(1-3) (1995), 189-217.
30. I.P. Goulden and D.M. Jackson, Combinatorial enumeration, Wiley, New York, 1983.
31. G.H. Hardy, Ramanujan: Twelve lectures on subjects suggested by his life and work, 3rd ed. Chelsea, New York, 1978. [Reprinted and Corrected from the 1st ed., Cambridge, 1940].
32. H.-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmetiques, Ph.D. thesis, École Polytechnique, 1994.
33. S. Janson, D.E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Rand Struc Alg 4(3) (1993), 233-358.
34. D.F. Knuth, Linear probing and graphs, Algorithmica 22(4) (1998), 561-568.
35. V. F. Kolchin, Random graphs, Encyclopedia of Mathematics and its Applications, vol. 53, Cambridge University Press, Cambridge, 1999.
36. V.A. Liskovets, A pattern of asymptotic vertex valency distributions in planar maps, J Combin Theory Ser B 75(1) (1999), 116-133.
37. G. Louchard, The Brownian excursion: a numerical analysis, Comput Math Appl 10(6) (1984), 413-417.
38. A. Meir, and J.W. Moon, On the altitude of nodes in random trees, Can J Math 30 (1978), 997-1015.
39. A.M. Odlyzko, "Asymptotic enumeration methods," Handbook of combinatorics, vol. II, R. Graham, M. Grötschel, and L. Lovász, (Editors), Elsevier, Amsterdam, 1995, pp. 1063-1229.
40. F.W.J. Olver, Asymptotics and special functions, Academic Press, New York, 1974.
41. R. Pemantle, "Generating functions with high-order poles are nearly polynomial," Mathematics and computer science (Versailles, 2000). Birkhäuser, Basel, 2000, pp. 305-321.
42. T. Prellberg, Uniform q-series asymptotics for staircase polygons, J Phys A: Math Gen 28 (1995), 1289-1304.
43. L.B. Richmond and N.C. Wormald, Almost all maps are asymmetric. J Combin Theory Ser B 63(1) (1995), 1-7.
44. G. Schaeffer, Conjugaison d'arbres et cartes combinatoires aléatoires, Ph.D. thesis, Université Bordeaux I, 1998.
45. G. Schaeffer, Random sampling of large planar maps and convex polyhedra, Proc of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), Atlanta, Georgia, 1999, ACM, New York, pp. 760-769.
46. M. Soria-Cousineau, Méthodes d'analyse pour les constructions combinatoires et les algorithmes, Doctorate in sciences, Université de Paris-Sud, Orsay, 1990.
47. J. Spencer, Enumerating graphs and Brownian motion, Commun Pure Appl Math 50 (1997), 293-296.
48. L. Takacs, A Bernoulli excursion and its various applications, Adv Appl Probab 23 (1991), 557-585.
49. W.T. Tutte, A census of planar maps. Can J Math 15 (1963), 249-271.
50. W.T. Tutte, "Planar enumeration," Graph theory and combinatorics (Cambridge, 1983), Academic Press, London, 1984, pp. 315-319.
51. G.N. Watson, A treatise on the theory of Bessel functions, Cambridge University Press, Cambridge, 1980.
52. E.T. Whittaker and G.N. Watson, A course of modern analysis, 4th ed. Cambridge University Press, Cambridge, 1927. [Reprinted 1973].
53. R. Wong, Asymptotic approximations of integrals, Academic Press, New York, 1989.
54. V.M. Zolotarev, One-dimensional stable distributions, American Mathematical Society, Providence, RI, 1986. [Translated from the Russian by H.H. McFaden, Translation edited by Ben Silver.]