Episode 11d: Scale-free networks: Giant component condition | Complex Networks

Note: This is an archival, mostly functional site. All courses can be found here.

Episode 11d: Scale-free networks: Giant component condition

Episode 11c: Erdős–Rényi networks: Giant component condition

All Episodes

Episode 11e: A sneaky calculation that works but is totally wrong

Summary:

Scale-free networks are big on the spreading thing. We make some simple calculations and discuss the work of Pastor-Satorras and Vespignani.

Date:

2018/02/20

Duration:

5:02

2018/02/20

5:02

Lecture:

Tweet:

Covers, in part, this slide set:

07. Random Networks, Nutshellfully