 |
 |
3 of 32 |  |
 |
 |
MIT
Random Subgraphs
l
Start with any
graph G
l
Build G
(p)
»
same vertex set
»
keep each edge with probability p
l
What happens?
»
When connected?
»
When k
-connected?
MIT
Random Subgraphs
l
Start with any
graph G
l
Build G
(p)
»
same vertex set
»
keep each edge with probability p
l
What happens?
»
When connected?
»
When k
-connected?
|