2017
DOI: 10.1002/rsa.20754
|View full text |Cite
|
Sign up to set email alerts
|

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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
48
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 24 publications
(48 citation statements)
references
References 41 publications
(86 reference statements)
0
48
0
Order By: Relevance
“…To prove Lemma 16, we will use the following estimate due to Ordentlich and Roth [, Proposition 2.2].Theorem For any d (potentially depending on n), let p=d/n. The number true|scriptGdtrue| of d‐regular bipartite graphs on true[ntrue]true[ntrue] is at least true( n d true) 2 n true( p p true( 1 p true) 1 p true) n 2 . We remark that a precise asymptotic estimate for true|scriptGdtrue| has very recently become available, due to Liebenau and Wormald (the same result was also independently announced by Isaev and McKay ).Proof of Lemma The probability bold-italicB has exactly dn=pn2 edges is true( n 2 p n 2 true) p p n 2 true( 1 p true) true( 1 p true) n 2 1 n p true( 1 p true) = e o true( n true) . (here we used Stirling's approximation). By symmetry, each graph with dn edges is equally likely.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…To prove Lemma 16, we will use the following estimate due to Ordentlich and Roth [, Proposition 2.2].Theorem For any d (potentially depending on n), let p=d/n. The number true|scriptGdtrue| of d‐regular bipartite graphs on true[ntrue]true[ntrue] is at least true( n d true) 2 n true( p p true( 1 p true) 1 p true) n 2 . We remark that a precise asymptotic estimate for true|scriptGdtrue| has very recently become available, due to Liebenau and Wormald (the same result was also independently announced by Isaev and McKay ).Proof of Lemma The probability bold-italicB has exactly dn=pn2 edges is true( n 2 p n 2 true) p p n 2 true( 1 p true) true( 1 p true) n 2 1 n p true( 1 p true) = e o true( n true) . (here we used Stirling's approximation). By symmetry, each graph with dn edges is equally likely.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…In other words, the conditional distribution of S (λ jk ) with respect to given t is uniform. The random model of S (λ jk ) is referred as the β-model and it is a special case of the exponential family of random graphs, see [7,18] for more details. A further connection between S (λ jk ) and S t is established in Section 5.3.…”
Section: Complex-analytic Approachmentioning
confidence: 99%
“…where h(θ) = O(n −1/2+6ε ) uniformly for θ ∈ B 0 . A general theory on the estimation of such integrals was developed in [18]. This theory is based on the second-order approximation of complex martingales.…”
Section: The Critical Regionsmentioning
confidence: 99%
See 2 more Smart Citations