of Real-world Spatio-temporal Networks Matthew J. Williams University of Birmingham & University College London [email protected] http://www.mattjw.net @voxmjw Mirco Musolesi University College London
Nodes may be mobile (time-varying location) • Temporal: Time-evolving topology • Non-instantaneous interaction: Node-to-node interactions are constrained by space and may be non-instantaneous Generalised Spatio-Temporal Networks
B C E D A B C E D A B C E D A 2 m/s 1 m/s 4 6 6 4 1 m/s 4 4 2 2 • Time-varying network • Encode propagation speed on each (directed) link • Possibly infinite for instantaneous transmission networks • Allows us to derive the interaction delay for a pair of nodes
timestep • Increment progress between two nodes according to their physical distance and the propagation speed of their link • Absence of a link ‘resets’ the process between two nodes 1 m/s 1 m/s ✘ t=1 t=2 t=3 t=4 1 sec 1 sec 1 sec 1 sec
mutually reachable nodes Relative loss in temporal efficiency Temporal efficiency: Average reciprocal temporal distance Lower efficiency means more “delay” in the network Relative loss in spatial efficiency Spatial efficiency: Average reciprocal spatial distance Lower efficiency means shortest paths traverse longer distances
mutually reachable nodes Relative loss in temporal efficiency Temporal efficiency: Average reciprocal temporal distance Lower efficiency means more “delay” in the network Relative loss in spatial efficiency Spatial efficiency: Average reciprocal spatial distance Lower efficiency means shortest paths traverse longer distances 1 㱺 same efficiency as intact network 0 㱺 all disconnected Relative change: 1 㱺 same efficiency as intact network 0 㱺 all disconnected Relative change:
0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 Giant Component Size S Err PB TC ID OD BE PB Node Failure: Systematic • Random failure • Node deactivated with failure probability f • Systematic attacks • Path betweenness: Target nodes which support many shortest paths Objective: Dismantle the giant component • Betweenness efficiency: Target nodes which allow fast information flow Objective: Degrade the temporal efficiency; i.e., increase delay in the network • (Very effective attacks. Worst case behaviour. Require global knowledge.) 10 3 10 2 10 1 100 Removal Rate f 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 Giant Component Size S Err PB TC ID OD BE Rand. 10 3 10 2 10 1 100 Removal Rate f 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 Giant Component Size S Err PB TC ID OD BE BE
• Generalisation of temporal networks with spatially embedded nodes and paths that preserve space-time constraints • Avoids over-simplification due to aggregation (static network models) and instantaneous transmission (temporal network models)
University of Birmingham & University College London [email protected] http://www.mattjw.net @voxmjw Mirco Musolesi University College London Thanks for listening! http://arxiv.org/abs/1506.00627 @mircomusolesi
https://www.flickr.com/photos/donkeyhotey/5679642871 C. Elegans “I: these are nematodes”. snickclunk (Flickr CC). July 2006. https://www.flickr.com/photos/snickclunk/200926410 Roulette Wheel “roulette”. eatsmilesleep (Flickr CC). August 2011. https://www.flickr.com/photos/45378259@N05/6050121954