OurBigBook About$ Donate
 Sign in Sign up

Isolated-vertex threshold in the Erdős-Rényi model

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Random graph Erdős-Rényi model Isolated vertices in the Erdős-Rényi model
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
For p=clogn/n, the number N of isolated vertices satisfies
P(N=0)⟶{1,0,​c>1,c<1.​
(1)
The upper side follows from the first-moment bound. On the lower side, EN→∞ and var(N)/(EN)2→0, so the second-moment method applies.

 Ancestors (8)

  1. Isolated vertices in the Erdős-Rényi model
  2. Erdős-Rényi model
  3. Random graph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Connectivity hitting time equals disappearance of isolated vertices
  • Past exam of the mathematics course of the University of Cambridge / 2024 / ia / Paper 2 / 12F / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook