Spatio-temporal networks: reachability, centrality and robustness

@article{Williams2015SpatiotemporalNR,
  title={Spatio-temporal networks: reachability, centrality and robustness},
  author={Matthew J. Williams and Mirco Musolesi},
  journal={Royal Society Open Science},
  year={2015},
  volume={3}
}
Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems… 

Figures and Tables from this paper

Measuring hub locations in time-evolving spatial interaction networks based on explicit spatiotemporal coupling and group centrality

The empirical analysis indicates that the proposed method enables the identification of typical hub locations clustered in space and stable over time, essential to understand the centrality of locations informed by noisy and inconsistent data in their spatial and temporal dimensions.

Concurrency and reachability in treelike temporal networks

This work studies reachability in terms of the overall levels of temporal concurrency between edges and the structural cohesion of the network agglomerating over all edges, and develops heterogeneous mean-field model predictions for random networks to better quantify how the properties of the underlying temporal network regulate reachability.

Temporal Networks Based on Human Mobility Models: A Comparative Analysis With Real-World Networks

Results show that the various topological properties of most of the synthetic datasets depart from those observed in real-world contact networks because the randomness of some mobility parameters tends to move away from human contact properties, but it appears that data generated using Spatio-Temporal Parametric Stepping mobility model reveals similarities with real temporal contact networks.

Centrality Metrics in Dynamic Networks: A Comparison Study

A method recently introduced to three existing methods for evaluating the importance of nodes in static networks is compared, and it is shown that in some cases it might be meaningless to try to identify nodes that are globally important.

Epidemic spreading on time-varying multiplex networks

It is found that higher values of multiplexity significantly reduce the epidemic threshold especially when the temporal activation patterns of nodes present on multiple layers are positively correlated, and when the average connectivity across layers is very different, the contagion dynamics is driven by the features of the more densely connected layer.

Temporal networks: a review and opportunities for infrastructure simulation

The study highlights the fact that considering the time dimension insimulating complex networks is a relatively new research field that presents new research frontiers for breakthrough opportunities in simulating complex interdependent infrastructure networks.

Modeling Urban Venue Dynamics through Spatio-Temporal Metrics and Complex Networks

This dissertation explores how novel algorithmic architectures and techniques reveal and predict business trends and urban development patterns, and proposes algorithms tailored for three computing tasks focused on modeling venue dynamics, characteristics, and trends.

Temporal betweenness centrality in dynamic graphs

The bi-objective notion of shortest–fastest path (SFP) in temporal graphs is proposed, which considers both space and time as a linear combination governed by a parameter, and a novel temporal betweenness centrality (TBC) metric is defined that outperforms static BC in the task of identifying the best vertices for propagating information.

Correlations of network trajectories

This work constructs stochastic and deterministic graph dynamical systems and shows that the emergent collective correlations are well captured by simple measures, and illustrates how these patterns are revealed in empirical networks arising in different domains.

A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions

The data structure answers reachability queries regarding the existence of a journey from a given node to another within given time interval in time O(log τ); it has an amortized insertion time of O(n log τ); and it can reconstruct a valid journey that witnesses reachability in timeO(k log τ), where k < n is the maximum number of edges of this journey.
...

References

SHOWING 1-10 OF 96 REFERENCES

Graph Metrics for Temporal Networks

This chapter discusses how to represent temporal networks and the definitions of walks, paths, connectedness and connected components valid for graphs in which the links fluctuate over time, and focuses on temporal node–node distance.

Spatial Networks

  • M. Barthelemy
  • Computer Science
    Encyclopedia of Social Network Analysis and Mining
  • 2014

Path lengths, correlations, and centrality in temporal networks

  • R. K. PanJ. Saramäki
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
Differences between static and temporal properties are further highlighted in studies of the temporal closeness centrality, and correlations and heterogeneities in the underlying event sequences affect temporal path lengths, increasing temporal distances in communication networks and decreasing them in the air transport network.

Vulnerability of weighted networks

The analysis of weighted properties shows that centrality driven attacks are capable of shattering the network’s communication or transport properties even at a very low level of damage in the connectivity pattern and the inclusion of weight and traffic provides evidence for the extreme vulnerability of complex networks to any targeted strategy.

Multiscale Analysis of Spreading in a Large Communication Network

A multiscale analysis shows that for the spreading velocity, time-domain inhomogeneities are as important as the network topology, which indicates the need to take time- domain information into account when studying spreading dynamics.

Connectivity and inference problems for temporal networks

This work defines and studies the class of inference problems, in which it seeks to reconstruct a partially specified time labeling of a network in a manner consistent with an observed history of information flow, and provides results on two types of problems for temporal networks.

Temporal distance metrics for social network analysis

New temporal distance metrics to quantify and compare the speed (delay) of information diffusion processes taking into account the evolution of a network from a local and global view are proposed and shown how these metrics are able to capture the temporal characteristics of time-varying graphs.

Navigability of interconnected networks under random failures

Fundamental mechanisms to perform exploration of a city using the multiple transportation layers using random walks on multilayer networks are introduced, and it is shown how the topological structure, together with the navigation strategy, influences the efficiency in exploring the whole structure.

Network reachability of real-world contact sequences.

  • P. Holme
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
This work uses real-world contact sequences, time-ordered lists of contacts from one person to another, to study how fast information or disease can spread across network of contacts and concludes that the network reachability depends much on a core where the path lengths are short and communication frequent.

Localized attacks on spatially embedded networks with dependencies

A theoretical and numerical approach is developed to describe and predict the effects of localized attacks on spatially embedded systems with dependencies and it is found that a localized attack can cause substantially more damage than an equivalent random attack.
...