OurBigBook About$ Donate
 Sign in Sign up

Poisson limit for triangles in a binomial random graph ((3n​)p3→α⟹X→Poisson(α))

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Binomial random graph Triangle count in a binomial random graph
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Convergence holds in total variation distance. A triangle indicator depends only on its three edges, so its dependency neighborhood consists of itself and the 3(n−3) triangles sharing an edge. The Poisson approximation with dependency neighborhoods gives errors b1​=O(n4p6) and b2​=O(n4p5). Under the displayed scaling p is of order n−1, so both vanish. The probability of at least one triangle therefore tends to 1−e−α.

 Ancestors (7)

  1. Triangle count in a binomial random graph
  2. Binomial random graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 37 / 3 / Solution
  • Triangle-existence threshold in a binomial random graph

 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