Models and Algorithms for Dynamic Networks

Published on Jul 02, 20123915 Views

Function Prediction in Complex Networks 2012 - Kavli Royal Society Centre

Models and Algorithms for Dynamic Networks00:00

Part 1: Models00:01

Dynamic Networks: Modelling Challenges00:43

New Triadic Closure Model03:37

Triangulation Model: Start with ER(0.3)06:07

Triangulation Model: Start with ER(0.15)07:19

Mean Field Analysis of Triangulation Model08:06

N = 100, ω = 0.01, ϵ = 5x10-4, δ = 4x10-412:07

Edge Density: Mean-Field pk vs. Simulation12:51

Edge Density: 5 Simulations, G0 = ER(0.23)13:52

Dynamic Models: What’s New?15:41

Part 2: Katz-style Centrality Measures22:36

What Is a Walk through a Dynamic Network? (1)22:59

What Is a Walk through a Dynamic Network? (2)23:06

What Is a Walk through a Dynamic Network? (3)23:08

What Is a Walk through a Dynamic Network? (4)23:31

Dynamic Walks23:48

New Algorithm24:32

Dynamic Centrality26:38

Dynamic Communicators: Enron Email27:37

Downweighting Over Time28:54

Enron Daily Emails: Ability to Predict Tomorrow’s Centrality30:15

Dynamic Centrality: What’s New?31:29