Slide Set 07: Random Networks, Nutshellfully
A brief reprise of the imagined pure random networks, and their very useful extension to allow for arbitrary degree distributions.
Simple, flat slides:
29M
; Last updated: 2019/02/14, 14:00:40
Printable handout:
9.9M
; Last updated: 2019/02/14, 13:56:31
Slides with all reveals for lectures:
45M
; Last updated: 2019/02/14, 13:46:51
Covered in these episodes:
10b: Random Networks intro (6:43)
10c: Construction methods 1/2 (6:32)
10d: Visual examples of random networks (7:37)
10e: Phase transition: The appearance of the Giant Component (2:42)
10f: Clustering = 0 for random networks (3:04)
10g: Pure random networks have Poission degree distributions (6:16)
10h: Generalized random networks, or The Configuration Model (6:10)
10i: Construction methods 2/2 (6:23)
10j: Motifs (2:43)
10k: Edge-degree distribution (11:44)
10l: Upsettingly strange friends (4:39)
11a: The giant component condition for random networks (7:23)
11b: A better spreading condition (9:40)
11c: Erdős–Rényi networks: Giant component condition (1:14)
11d: Scale-free networks: Giant component condition (5:02)