Small-world behavior in time-varying graphs.

  title={Small-world behavior in time-varying graphs.},
  author={John Kit Tang and Salvatore Scellato and Mirco Musolesi and Cecilia Mascolo and Vito Latora},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={81 5 Pt 2},
  • J. Tang, S. Scellato, V. Latora
  • Published 9 September 2009
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Connections in complex networks are inherently fluctuating over time and exhibit more dimensionality than analysis based on standard static graph measures can capture. Here, we introduce the concepts of temporal paths and distance in time-varying graphs. We define as temporal small world a time-varying graph in which the links are highly clustered in time, yet the nodes are at small average temporal distances. We explore the small-world behavior in synthetic time-varying networks of mobile… 

Figures and Tables from this paper

Components in time-varying graphs
The notion of connectedness, and the definitions of node and graph components, are extended to the case of time-varying graphs, which are represented as time-ordered sequences of graphs defined over a fixed set of nodes.
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
A general approach to study that evolution for both atemporal and temporal indicators, based respectively on sequences of static graphs and sequences of time-varying graphs that cover successive time-windows is proposed.
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.
Coverage centralities for temporal networks
This paper defines two centrality measures of a temporal vertex based on the fastest temporal paths which use the temporal vertex, and reveals that distributions of these centrality values of real-world temporal networks are heterogeneous.
Preserving Sparsity in Dynamic Network Computations
A new algorithm for computing time-dependent centrality that works with a sparsified version of the dynamic communicability matrix is derived, which allows us to capture centrality over time with a minimal level of storage and with a cost that scales only linearly with the number of time points.
A matrix iteration for dynamic network
A new algorithm is proposed for summarizing properties of large-scale time-evolving networks that generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at non-uniform points in time.
Social Network Analysis and Time Varying Graphs
The thesis proposes a general framework to present, in a comprehensive model, the influence of the social web on e-commerce decision making through the analysis of social networks with particular emphasis on their temporal aspects.
A Matrix Iteration for Dynamic Network Summaries
The proposed algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time, and takes the conventional approach of downweighting for length and the novel feature of down Weighting for age.
Random Walks on Stochastic Temporal Networks
A stochastic model for temporal networks is introduced in which the temporal and structural organization of a system using a matrix of waiting-time distributions is summarized using an integro-differential master equation and an analytical expression for its asymptotic steady state is derived.
Social networks: Evolving graphs with memory dependent edges


Persistence and periodicity in a dynamic proximity network
It is suggested that dynamic social networks exhibit a natural time scale \Delta_{nat}, and that the best conversion of such dynamic data to a discrete sequence of networks is done at this natural rate.
Recovering time-varying networks of dependencies in social and biological studies
  • Amr Ahmed, E. Xing
  • Computer Science
    Proceedings of the National Academy of Sciences
  • 2009
A machine learning method called TESLA is presented, which builds on a temporally smoothed l1-regularized logistic regression formalism that can be cast as a standard convex-optimization problem and solved efficiently by using generic solvers scalable to large networks.
Microdynamics in stationary complex networks
A model of dynamical networks is proposed, inspired from previous studies on firm growth, which reproduces most of the empirical observations both for the stationary statistical distributions and for the dynamical properties.
Dynamical and bursty interactions in social networks.
The modeling framework can be easily extended and paves the way for systematic investigations of dynamical processes occurring on rapidly evolving dynamical networks, such as the propagation of an information or spreading of diseases.
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.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Disease spreading in populations of moving agents
We study the effect of motion on disease spreading in a system of random walkers which additionally perform long-distance jumps. A small percentage of jumps in the agent motion is sufficient to
Efficient behavior of small-world networks.
It is shown that the underlying general principle of their construction is in fact a small-world principle of high efficiency, which gives a clear physical meaning to the concept of "small world," and also a precise quantitative analysis of both weighted and unweighted networks.