Large deviation for uniform graphs with given degrees-Reference-Cited by-同舟云学术

Large deviation for uniform graphs with given degrees

Published:2022-06-01 Issue:3 Volume:32 Page:
ISSN:1050-5164
Container-title:The Annals of Applied Probability
language:
Short-container-title:Ann. Appl. Probab.

Author:

Dhara Souvik¹,Sen Subhabrata²

Affiliation:

1. Department of Mathematics, Massachusetts Institute of Technology

2. Department of Statistics, Harvard University

Publisher

Institute of Mathematical Statistics

Subject

Statistics, Probability and Uncertainty,Statistics and Probability

Reference49 articles.

1. Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T. and Vesztergombi, K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801–1851.

2. AUGERI, F. (2018). Nonlinear large deviation bounds with applications to traces of Wigner matrices and cycles counts in Erdős–Rényi graphs. Available at arXiv:1810.01558.

3. BARVINOK, A. and HARTIGAN, J. A. (2013). The number of graphs and a random graph with a given degree sequence. Random Structures Algorithms 42 301–348.

4. BHATTACHARYA, S. and DEMBO, A. (2021). Upper tail for homomorphism counts in constrained sparse random graphs. Random Structures Algorithms 59 315–338.

5. BLITZSTEIN, J. and DIACONIS, P. (2010). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6 489–522.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Regularity method and large deviation principles for the Erdős–Rényi hypergraph;Duke Mathematical Journal;2024-04-01

2. A sample-path large deviation principle for dynamic Erdős–Rényi random graphs;The Annals of Applied Probability;2023-08-01

3. Large Deviation Principle for Random Permutations;International Mathematics Research Notices;2023-05-16