Bibliographic Details
| Title: |
Complex martingales and asymptotic enumeration. |
| Authors: |
Isaev, Mikhail, McKay, Brendan D. |
| Superior Title: |
Random Structures & Algorithms; Jul2018, Vol. 52 Issue 4, p617-661, 45p |
| Subject Terms: |
MARTINGALES (Mathematics), INTEGRALS, RANDOM graphs, BIPARTITE graphs, RASCH models |
| Abstract: |
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 behavior 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 β‐model of random graphs with independent edges, which is equivalent to the Rasch model in the bipartite case. [ABSTRACT FROM AUTHOR] |
|
Copyright of Random Structures & Algorithms is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
