Complex martingales and asymptotic enumeration

Abstract

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic behaviour of such integrals, we establish explicit bounds on the exponentials of complex martingales. Those bounds applied to the case of truncated normal distributions are precise enough to include and extend many enumerative results of Barvinok, Canfield, Gao, Greenhill, Hartigan, Isaev, McKay, Wang, Wormald, and others. Our method applies to sums as well as integrals. As a first illustration of the power of our theory, we considerably strengthen existing results on the relationship between random graphs or bipartite graphs with specified degrees and the so-called $\beta$-model of random graphs with independent edges, which is equivalent to the Rasch model in the bipartite case.

Minor changes as accepted by Random Structures and Algorithms

References in corpus (2)

• A Fourier-analytic Approach to Counting Partial Hadamard Matrices
• On a bound of Hoeffding in the complex case

Cited by in corpus (7)

• Subgraph counts for dense random graphs with specified degrees
• Color Characters for White Hot String Bits
• Distribution of tree parameters by martingale approach
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The asymptotic volume of diagonal subpolytopes of symmetric stochastic matrices
• Sandwiching random regular graphs between binomial random graphs
• Embedding theorems for random graphs with specified degrees