OurBigBook
About
$
Donate
Sign in
Sign up
Triangle count in a binomial random graph
ID: triangle-count-in-a-binomial-random-graph
Top articles
Latest articles
New article in topic
Show body
Body
0
Triangle count in a binomial random graph
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
If
X
counts
triangles
in
G
(
n
,
p
)
, then
E
X
=
(
3
n
)
p
3
(1)
and
var
X
≤
(
3
n
)
p
3
+
2
(
2
n
)
(
2
n
−
2
)
p
5
.
(2)
Thus
n
p
→
∞
implies
var
X
/
(
E
X
)
2
→
0
, and the
second moment method
gives
P
(
X
>
0
)
→
1
.
Total
articles
:
1
New to
topics
?
Read the docs here!