Abstract
A dense graph is a graph whose number of edges is comparable to the square of the number of vertices. The main result of this chapter is the formulation and proof of the large deviation principle for dense Erdős–Rényi random graphs. We will see later that this result can be used to derive large deviation principles for a large class of models. These and other applications will be given in later chapters. The results and definitions from the previous chapters will be used extensively in the proofs of this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bollobás, B. (2001). Random graphs, 2nd ed., vol. 73, Cambridge studies in advanced mathematics. Cambridge: Cambridge University Press.
Chatterjee, S., & Varadhan, S. R. S. (2011). The large deviation principle for the Erdős-Rényi random graph. European Journal of Combinatorics, 32(7), 1000–1017.
Erdős, P., & Rényi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17–61.
Frieze, A., & Kannan, R. (1999). Quick approximation to matrices and applications. Combinatorica, 19, 175–220.
Gilbert, E. N. (1959). Random graphs. Annals of Mathematical Statistics, 30(4), 1141–1144.
Janson, S., Łuczak, T., & Ruciński, A. (2000). Random graphs. Wiley-interscience series in discrete mathematics and optimization. New York: Wiley-Interscience.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Chatterjee, S. (2017). Large Deviations for Dense Random Graphs. In: Large Deviations for Random Graphs. Lecture Notes in Mathematics(), vol 2197. Springer, Cham. https://doi.org/10.1007/978-3-319-65816-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-65816-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65815-5
Online ISBN: 978-3-319-65816-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)