Planar maps and airy phenomena

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 388-402

  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

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AIRY FUNCTION; ANALYSIS OF ALGORITHMS; ASYMPTOTIC DISTRIBUTIONS; COMBINATORICS; CONNECTED COMPONENT; PLANAR GRAPH; PLANAR MAPS; RANDOM GENERATION;

AUTOMATA THEORY;

EID: 84974625368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_33     Document Type: Conference Paper

References (24)

1. Carl M. Bender and Steven 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.
2. Edward A. Bender, L. Bruce Richmond, and Nicholas C. Wormald. Largest 4- connected components of 3-connected planar triangulations. Random Structures & Algorithms, 7(4):273-285, 1995.
3. Norman Bleistein and Richard A. Handelsman. Asymptotic Expansions of Integrals. Dover, New York, 1986. A reprint of the second Holt, Rinehart and Winston edition, 1975.
4. Bèla Bollobàs, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, and David B. Wilson. The scaling window of the 2-sat transition. Preprint, 1999. Available as document math.CO/9909031 at the Los Alamos archive http://xxx.lanl.gov/form/.
5. N. G. De Bruijn. Asymptotic Methods in Analysis. Dover, 1981. A reprint of the third North Holland edition, 1970 (first edition, 1958).
6. Michael Drmota and Michèle Soria. Marking in combinatorial constructions: Generating functions and limiting distributions. Theoretical Computer Science, 144(1-2):67-99, June 1995.
7. Philippe Duchon. Q-grammars and wall polyominoes. Annals of Combinatorics, 3:311-321, 1999.
8. P. Flajolet, D. E. Knuth, and B. Pittel. The first cycles in an evolving graph. Discrete Mathematics, 75:167-215, 1989.
9. Philippe Flajolet and Andrew M. Odlyzko. Singularity analysis of generating functions. SIAM Journal on Applied Mathematics, 3(2):216-240, 1990.
10. Philippe Flajolet, Patricio Poblete, and Alfredo Viola. On the analysis of linear probing hashing. Algorithmica, 22(4):490-515, December 1998.
11. Zhicheng Gao and Nicholas C. Wormald. The size of the largest components in random planar maps. SIAM J. Discrete Math., 12(2):217-228 (electronic), 1999.
12. Ian P. Goulden and David M. Jackson. Combinatorial Enumeration. John Wiley, New York, 1983.
13. Svante Janson, Donald E. Knuth, Tomasz Luczak, and Boris Pittel. The birth of the giant component. Random Structures & Algorithms, 4(3):233-358, 1993.
14. V. F. Kolchin. Random Graphs, volume 53 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, U.K., 1999.
15. G. Louchard. The Brownian excursion: a numerical analysis. Computers and Mathematics with Applications, 10(6):413-417, 1984.
16. Thomas Prellberg. Uniform q-series asymptotics for staircase polygons. Journal of Physics A: Math. Gen., 28:1289-1304, 1995.
17. L. B. Richmond and N. C. Wormald. Almost all maps are asymmetric. J. Combin. Theory Ser. B, 63(1):1-7, 1995.
18. Gilles Schaeffer. Conjugaison d’arbres et cartes combinatoires alèatoires. PhD thesis, Universitè Bordeaux I, 1998.
19. Gilles Schaeffer. Random sampling of large planar maps and convex polyhedra. In Proceedings of the thirty-first annual ACM symposium on theory of computing (STOC’99), pages 760-769, Atlanta, Georgia, may 1999. ACM press.
20. Michèle Soria-Cousineau. Mèthodes d’analyse pour les constructions combinatoires et les algorithmes. Doctorate in sciences, Universitè de Paris-Sud, Orsay, July 1990.
21. Lajos Takacs. A Bernoulli excursion and its various applications. Advances in Applied Probability, 23:557-585, 1991.
22. W. T. Tutte. Planar enumeration. In Graph theory and combinatorics (Cambridge, 1983), pages 315-319. Academic Press, London, 1984.
23. G. N. Watson. A Treatise on the Theory of Bessel Functions. Cambridge University Press, 1980.
24. Roderick Wong. Asymptotic Approximations of Integrals. Academic Press, 1989.