Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs

  • Conference paper
  • First Online:
Random Walks, Boundaries and Spectra

Part of the book series: Progress in Probability ((PRPR,volume 64))

Abstract

We review some recent results on the exact asymptotics of the components in the inhomogeneous random graph models of rank 1.We discuss the relevance of these results to the analysis of random walk on random graphs.

Mathematics Subject Classification (2000). Primary 60C05; Secondary 05C80.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 (1997), no. 2, 812–854.

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Aldous and V. Limic. The entrance boundary of the multiplicative coalescent. Electron. J. Probab. 3 (1998) 1–59.

    MathSciNet  Google Scholar 

  3. B. Bollob´as, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs. Random Structures and Algorithms 31 (2007), 3–122.

    Google Scholar 

  4. B. Bollob´as, S. Janson and O. Riordan, The cut metric, random graphs, and branching processes. arXiv:0901.2091 [math.PR]

    Google Scholar 

  5. Bhamidi S., van der Hofstad R. and van Leeuwaarden J., Scaling limits for critical inhomogeneous random graphs with finite third moments, arXiv:0907.4279v1 [math.PR]

    Google Scholar 

  6. Bhamidi S., van der Hofstad R. and van Leeuwaarden J., Novel scaling limits for critical inhomogeneous random graphs, arXiv:0909.1472 [math.PR]

    Google Scholar 

  7. A.J. Bray and G.J. Rodgers, Diffusion in a sparsely connected space: A model for glassy relaxation. Phys. Rev. B 38 (1988) 11461–11470

    Article  MathSciNet  Google Scholar 

  8. T. Britton, M. Deijfen and A. Martin-L¨of, Generating simple random graphs with prescribed degree distribution. Journal of Statistical Physics, 124 (2006), 1/2, 1377– 1397.

    Google Scholar 

  9. P. Erd¨os and A. R´enyi, On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), 17–61.

    Google Scholar 

  10. F. Chung and L. Lu, The volume of the giant component of a random graph with given expected degree. SIAM J. Discrete Math. 20 (2006), 395–411

    Article  MathSciNet  MATH  Google Scholar 

  11. H. van den Esker, R. van der Hofstad, and G. Hooghiemstra, Universality for the distance in finite variance random graphs. J. Stat. Phys. 133 (2008), no. 1, 169–202.

    Article  MathSciNet  MATH  Google Scholar 

  12. R. van der Hofstad, Critical behavior in inhomogeneous random graphs. Report 1, 2008/2009 Spring, Institute Mittag-Leffler.

    Google Scholar 

  13. S. Janson, T. _Luczak, and A. Ruci´nski, Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.

    Google Scholar 

  14. S. Janson, Asymptotic equivalence and contiguity of some random graphs. Random Structures Algorithms, 36 (2010) 26–45.

    Article  MathSciNet  MATH  Google Scholar 

  15. S. Janson, The largest component in a subcritical random graph with a power law degree distribution Ann. Appl. Probab. (2008), 1651–1668.

    Google Scholar 

  16. R.M. Karp, The transitive closure of a random digraph. Random Structures Algorithms

    Google Scholar 

  17. 1 (1990), no. 1, 73–93.

    Google Scholar 

  18. O. Khorunzhiy, W. Kirsch, and P. M¨uller, Lifshitz tails for spectra of random Erd¨os-

    Google Scholar 

  19. R´enyi graphs. Ann. Appl. Probab. 6 (2006) 295–309.

    Google Scholar 

  20. A. Martin-L¨of, The final size of a nearly critical epidemic, and the first passage

    Google Scholar 

  21. time of a Wiener process to a parabolic barrier. J. Appl. Probab. 35 (1998), no. 3

    Google Scholar 

  22. 671–682.

    Google Scholar 

  23. A. Nachmias and Y. Peres, Critical percolation on random regular graphs. To appear

    Google Scholar 

  24. in Random Structures and Algorithms.

    Google Scholar 

  25. I. Norros and H. Reittu. On a conditionally Poissonian graph process. Adv. in Appl.

    Google Scholar 

  26. Probab. 38 (2006) 59–75.

    Google Scholar 

  27. R. Otter, The multiplicative process. Ann. Math. Statistics 20 (1949), 206–224.

    Article  MathSciNet  MATH  Google Scholar 

  28. B. Pittel, On the largest component of the random graph at a nearcritical stage. J.

    Google Scholar 

  29. of Combinatorial Theory, Series B 82 (2001) 237–269.

    Google Scholar 

  30. T.S. Turova, Long paths and cycles in the dynamical graphs. Journal of Statistical

    Google Scholar 

  31. Physics, 110 (2003), 1/2, 385–417.

    Google Scholar 

  32. T.S. Turova, The size of the largest component below phase transition in inhomogeneous

    Google Scholar 

  33. random graphs, arXiv:0706.2106v1 [math.PR]

    Google Scholar 

  34. T.S. Turova, Asymptotics for the size of the largest component scaled to “log n”

    Google Scholar 

  35. in inhomogeneous random graphs, Combinatorics, Probability and Computations 20

    Google Scholar 

  36. 131–154.

    Google Scholar 

  37. T.S. Turova, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1, arXiv:0907.0897 [math.PR]

    Google Scholar 

  38. T.S. Turova and T. Vallier, Merging percolation on Zd and classical random graphs: Phase transition. Random Structures and Algorithms 36, 185–217.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Center, University of Lund, 118, S-221 00, Lund, Sweden

    Tatyana S. Turova

Authors
  1. Tatyana S. Turova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tatyana S. Turova .

Editor information

Editors and Affiliations

  1. Mathematisches Inst., Universität Jena, Ernst-Abbe-Platz 2, Jena, 07737, Germany

    Daniel Lenz

  2. Inst. Mathematik C, TU Graz, Steyrergasse 30, Graz, 8010, Austria

    Florian Sobieczky

  3. Inst. Mathematik C, TU Graz, Steyrergasse 30, Graz, 8010, Austria

    Wolfgang Woess

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Basel AG

About this paper

Cite this paper

Turova, T.S. (2011). Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs. In: Lenz, D., Sobieczky, F., Woess, W. (eds) Random Walks, Boundaries and Spectra. Progress in Probability, vol 64. Springer, Basel. https://doi.org/10.1007/978-3-0346-0244-0_14

Download citation

Publish with us

Policies and ethics

Search

Navigation