Episode 2018-02-20-11c: Erdős–Rényi networks: Giant component condition

Summary:

Almost all random networks have Poisson degree distributions but, and this needs to be chanted every morning before breakfast, we never find these networks in the real world. We determine the condition for a giant component: the average degree exceeds 1. We will return to how Poisson distributions deceive.

Date:

2018/02/20

Duration:

1:14

2018/02/20

1:14

Tweet:


Covers, in part, this slide set:




Share this page:


Social places for PoCS:


Three random tarot cards:




RapidWeaver Icon

Made in RapidWeaver