Airy Phenomena and Analytic Combinatorics of Connected Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Airy Phenomena and Analytic Combinatorics of Connected Graphs

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Bruno Salvy
Gilles Schaeffer

Abstract

Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipulations. We show here that it is possible to make analytic sense of the divergent series that expresses the generating function of connected graphs. As a consequence, it becomes possible to derive analytically known enumeration results using only first principles of combinatorial analysis and straight asymptotic analysis---specifically, the saddle-point method. In this perspective, the enumeration of connected graphs by excess (of number of edges over number of vertices) derives from a simple saddle-point analysis. Furthermore, a refined analysis based on coalescent saddle points yields complete asymptotic expansions for the number of graphs of fixed excess, through an explicit connection with Airy functions.
Fichier principal
Vignette du fichier
RR-4581.pdf (935.7 Ko) Télécharger le fichier

Dates and versions

inria-00072004 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072004 , version 1

Cite

Philippe Flajolet, Bruno Salvy, Gilles Schaeffer. Airy Phenomena and Analytic Combinatorics of Connected Graphs. [Research Report] RR-4581, INRIA. 2002. ⟨inria-00072004⟩
61 View
187 Download

Share

Gmail Facebook Twitter LinkedIn More