OurBigBook
About
$
Donate
Sign in
Sign up
Sprinkling of a binomial random graph
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Random graph
Erdős-Rényi model
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Sprinkling
exposes
independent rounds
G
(
n
,
p
1
)
,
…
,
G
(
n
,
p
k
)
. Their union has
distribution
G
(
n
,
p
)
where
1
−
p
=
∏
i
=
1
k
(
1
−
p
i
)
.
(1)
Ancestors
(7)
Erdős-Rényi model
Random graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2023
/
iii
/
Paper 122
/
3
/
d
/
Solution
View article source
Discussion
(0)
Subscribe (1)
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