The Annals of Applied Probability

On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase

B. G. Pittel

Full-text: Open access

Abstract

A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ>3, in a subcritical phase with high probability the largest component size does not exceed n1/γ+ɛn, ɛn=O(ln ln n/ln n), 1/γ being the best power for this random graph. This is similar to the best possible n1/(γ−1) bound for a different model of the random graph, one with independent vertex degrees, conjectured by Durrett, and proved recently by Janson.

Article information

Source
Ann. Appl. Probab., Volume 18, Number 4 (2008), 1636-1650.

Dates
First available in Project Euclid: 21 July 2008

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1216677135

Digital Object Identifier
doi:10.1214/07-AAP493

Mathematical Reviews number (MathSciNet)
MR2434184

Zentralblatt MATH identifier
1149.05043

Subjects
Primary: 60C05: Combinatorial probability 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Keywords
Random graph degree sequence power law largest cluster pairing process martingale asymptotic bounds

Citation

Pittel, B. G. On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase. Ann. Appl. Probab. 18 (2008), no. 4, 1636--1650. doi:10.1214/07-AAP493. https://projecteuclid.org/euclid.aoap/1216677135


Export citation

References

  • [1] Balogh, J. and Pittel, B. (2007). Bootstrap percolation on the random regular graph. Random Structures Algorithms 30 257–286.
  • [2] Bender, E. A. and Canfield, E. R. (1978). The asymptotic number of labelled graphs with given degree sequences. J. Comb. Theory Ser. A 24 296–307.
  • [3] Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Univ. Press.
  • [4] Durrett, R. (2005). Probability: Theory and Examples, 3rd ed. Wadsworth and Brooks/Cole, Pacific Grove, CA.
  • [5] Durrett, R. (2006). Random Graph Dynamics. Cambridge Univ. Press.
  • [6] Janson, S. (2008). The largest component in a subcritical random graph with a power law degree distribution. Ann. Appl. Probab. 18 1651–1668.
  • [7] Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 161–179.
  • [8] Molloy, M. and Reed, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7 295–305.
  • [9] Pittel, B. (2008). Edge percolation on a random regular graph of low degree. Ann. Probab. 36 1359–1389.