The critical random graph, with martingales

@article{Nachmias2005TheCR,
  title={The critical random graph, with martingales},
  author={A. Nachmias and Y. Peres},
  journal={Israel Journal of Mathematics},
  year={2005},
  volume={176},
  pages={29-41}
}
  • A. Nachmias, Y. Peres
  • Published 2005
  • Mathematics
  • Israel Journal of Mathematics
    • We give a short proof that the largest component C1 of the random graph G(n, 1/n) is of size approximately n2/3. The proof gives explicit bounds for the probability that the ratio is very large or very small. In particular, the probability that n−2/3|C1| exceeds A is at most $${e^{ - c{A^3}}}$$ for some c > 0. 
    View on Springer
    arxiv.org
    50 Citations
    Highly Influencial Citations
    6
    Background Citations
    19
    Methods Citations
    8
    Results Citations
    2

    Figures from this paper

    Figures

    50 Citations
    Citation Type

    Citation Type

    On the largest component of the critical random digraph
    • 1
    Critical Random Graphs: Diameter and Mixing Time 1
    • 6
    • PDF
    The critical window in random digraphs
    • 5
    • PDF
    Critical random graphs: Diameter and mixing time
    • 84
    • PDF
    The probability of unusually large components in the near-critical Erdős–Rényi graph
    • 8
    • Highly Influenced
    • PDF
    The continuum limit of critical random graphs
    • 94
    • PDF
    The Largest Component in Critical Random Intersection Graphs
    • Bin Wang, L. Wang, K. Xiang
    • Computer Science, Mathematics
    • Discuss. Math. Graph Theory
    • 2018
    • 1
    Simple upper bounds for the largest components in critical inhomogeneous random graphs
    • 2
    • Highly Influenced
    • PDF
    Critical percolation on random regular graphs
    • 62
    • PDF
    Component sizes of the random graph outside the scaling window
    • 32
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    On the Largest Component of the Random Graph at a Nearcritical Stage
    • B. Pittel
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2001
    • 37
    • Highly Influential
    Random subgraphs of finite graphs: I. The scaling window under the triangle condition
    • 27
    A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
    • 22
    • PDF
    Component behavior near the critical point of the random graph process
    • 148
    • Highly Influential
    The Birth of the Giant Component
    • 422
    • PDF
    Random subgraphs of finite graphs: I. The scaling window under the triangle condition
    • 65
    • PDF
    On the evolution of random graphs
    • 5,313
    • PDF
    The Transitive Closure of a Random Digraph
    • R. Karp
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 1990
    • 204
    • PDF
    Component Behavior Near the Critical Point of the Random Graph Process
    • T. Luczak
    • Computer Science
    • Random Struct. Algorithms
    • 1990
    • 151
    The structure of a random graph at the point of the phase transition
    • 139
    • PDF