Analytic Combinatorics
Institut national de recherche en sciences et technologies du numérique · Centre de Recherche en Informatique · +1 more institution
Abstract
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of…
Citation impact
- FWCI
- 17.81
- Percentile
- 100%
- References
- 0
Authors
2Topics & keywords
- Generality
- Enumeration
- Computer science
- Enumerative combinatorics
- Theoretical computer science
- Graph theory
- Probability and statistics
- Mathematics
- Quality Education