Applications of Temporal Graph Metrics to Real-World Networks

@article{Tang2013ApplicationsOT,
  title={Applications of Temporal Graph Metrics to Real-World Networks},
  author={John Kit Tang and Ilias Leontiadis and Salvatore Scellato and Vincenzo Nicosia and Cecilia Mascolo and Mirco Musolesi and Vito Latora},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.6974}
}
Real world networks exhibit rich temporal information: friends are added and removed over time in online social networks; the seasons dictate the predator-prey relationship in food webs; and the propagation of a virus depends on the network of human contacts throughout the day. Recent studies have demonstrated that static network analysis is perhaps unsuitable in the study of real world network since static paths ignore time order, which, in turn, results in static shortest paths overestimating… 
Graph Metrics for Temporal Networks
TLDR
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.
Temporal Walk Centrality: Ranking Nodes in Evolving Networks
TLDR
It is shown that temporal walk centrality can identify nodes playing central roles in dissemination processes that might not be detected by related betweenness concepts and other common static and temporal centrality measures.
Time Centrality in Dynamic Complex Networks
TLDR
It is validated the concept of time centrality showing that diffusion starting at the best ranked time instants (i.e., the most central ones), according to the metrics, can perform a faster and more efficient diffusion process.
Dynamic Communicability Predicts Infectiousness
Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The
Modern temporal network theory: a colloquium
TLDR
This colloquium reviews the methods to analyze and model temporal networks and processes taking place on them, focusing mainly on the last three years, which includes the spreading of infectious disease, opinions, rumors, in social networks; information packets in computer networks; various types of signaling in biology, and more.
Efficient and Scalable Aggregate Computation on Temporal Graphs
TLDR
This paper focuses on aggregations, which are very common for relational data, but need to be computed efficiently and scalable for temporal graph data, and investigates the composition of aggregation functions and the distribution of the calculation.
Counting Temporal Paths
TLDR
This work initiates a systematic study of the prameterised and approximation complexity of #Temporal Path, the problem of counting all temporal paths between a fixed pair of vertices; like the problems of counting foremost and fastest temporal paths, it is #P-hard in general.
Within-Network Classification in Temporal Graphs
  • C. Ryther, J. Simonsen
  • Computer Science
    2018 IEEE International Conference on Data Mining Workshops (ICDMW)
  • 2018
TLDR
This work analyzes several classification problems using already established temporal metrics, and proposes label-sensitive and recency-sensitive variants of these metrics that capture labeling information and additional temporal patterns in the data.
Computing top-k temporal closeness in temporal networks
TLDR
This work introduces an efficient algorithm for computing the exact top- k temporal closeness values and the corresponding vertices and derives heuristic modifications that perform well on real-world data sets and drastically reduce the running times.
Efficient Top-k Temporal Closeness Calculation in Temporal Networks
TLDR
This work introduces an efficient algorithm for computing the exact top-$k$ temporal closeness values and the corresponding vertex sets in a given temporal network and derives a modification leading to a heuristic that often performs well on the majority of real-world data sets and drastically reduces the running times.
...
...

References

SHOWING 1-10 OF 71 REFERENCES
Exploiting temporal complex network metrics in mobile malware containment
TLDR
A time-aware containment strategy that spreads a patch message starting from nodes with high temporal closeness centrality and it is shown that this scheme reduces the cellular network resource consumption and associated costs, achieving complete containment of malware in a limited amount of time.
Temporal distance metrics for social network analysis
TLDR
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.
Analysing information flows and key mediators through temporal centrality metrics
TLDR
It is argued that dynamically evolving network topologies are inherent in many systems, including real online social and technological networks: fortunately the nature of these systems is such that they allow the gathering of large quantities of finegrained temporal data on interactions amongst the network members.
Graph Metrics for Temporal Networks
TLDR
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.
Attack vulnerability of complex networks.
TLDR
It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed.
Temporal Networks
Persistence and periodicity in a dynamic proximity network
TLDR
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.
STOP: Socio-Temporal Opportunistic Patching of short range mobile malware
TLDR
This paper presents Socio- Temporal Opportunistic Patching (STOP), a two-tier predictive mobile malware containment system: devices collect co-location data in a decentralized manner and report to a central server which processes and targets delivery of hot fixes to a small subset of k devices at runtime; in turn mobile devices spread the patch opportunistically.
Social encounter networks: collective properties and disease transmission
TLDR
The results of a large-scale survey of social encounters mainly conducted in Great Britain help to determine the types of realistic network structure that should be assumed in future population level studies of infection transmission, leading to better interpretations of epidemiological data and more appropriate policy decisions.
Discovering important nodes through graph entropy the case of Enron email database
TLDR
This work exploits an information theoretic model that combines information theory with statistical techniques from area of text mining and natural language processing to show how entropy models on graphs are relevant to study of information flow in an organization.
...
...