Episode 2018-02-20-11a: The giant component condition for random networks

Summary:

For random networks, we argue that if an edge leads to a node with on average more than 1 other edges, a giant component exists. Everything so far points towards writing down a condition that the mean of the $R_k$ distribution must exceed 1. We write this condition out but we then talk about its lack of story.

Date:

2018/02/20

Duration:

7:23

2018/02/20

7:23

Tweet:


Covers, in part, this slide set:




Share this page:


Social places for PoCS:


Three random tarot cards:




RapidWeaver Icon

Made in RapidWeaver