Skip to main content
SpringerLink
Log in

Applications of Dense Graph Large Deviations

  • Chapter
  • First Online:
Large Deviations for Random Graphs

Part of the book series: Lecture Notes in Mathematics ((LNMECOLE,volume 2197))

  • 2193 Accesses

Abstract

This chapter contains some simple applications of the large deviation principle for dense Erdős–Rényi random graphs that was derived in the previous chapter. The abstract theory yields surprising phase transition phenomena when applied to concrete problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chatterjee, S., & Dey, P. S. (2010). Applications of Stein’s method for concentration inequalities. Annals of Probability, 38, 2443–2485.

    Article  MathSciNet  MATH  Google Scholar 

  2. 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.

    Article  MathSciNet  MATH  Google Scholar 

  3. Chatterjee, S., & Varadhan, S. R. S. (2012). Large deviations for random matrices. Communications on Stochastic Analysis, 6(1), 1–13.

    MathSciNet  MATH  Google Scholar 

  4. Conlon, D., Fox, J., & Sudakov, B. (2010). An approximate version of Sidorenko’s conjecture. Geometric and Functional Analysis, 20(6), 1354–1366.

    Article  MathSciNet  MATH  Google Scholar 

  5. Hatami, H. (2010). Graph norms and Sidorenko’s conjecture. Israel Journal of Mathematics, 175, 125–150.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lubetzky, E. & Zhao, Y. (2015). On replica symmetry of large deviations in random graphs. Random Structures & Algorithms, 47(1), 109–146.

    Google Scholar 

  7. Sidorenko, A. (1993). A correlation inequality for bipartite graphs. Graphs and Combinatorics, 9(2), 201–204.

    Article  MathSciNet  MATH  Google Scholar 

  8. Simonovits, M. (1984). Extremal graph problems, degenerate extremal problems, and supersaturated graphs. In Progress in graph theory (Waterloo, Ontario, 1982) (pp. 419–437). Toronto, ON: Academic Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Stanford University, Stanford, CA, USA

    Sourav Chatterjee

Authors
  1. Sourav Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Chatterjee, S. (2017). Applications of Dense Graph Large Deviations. In: Large Deviations for Random Graphs. Lecture Notes in Mathematics(), vol 2197. Springer, Cham. https://doi.org/10.1007/978-3-319-65816-2_6

Download citation

Publish with us

Policies and ethics

Search

Navigation