Introduction to Algorithms
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Are you moved by your social network application?
Proceedings of the first workshop on Online social networks
The convergence of social and technological networks
Communications of the ACM - Remembering Jim Gray
The structure of information pathways in a social communication network
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
STEPS - an approach for human mobility modeling
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Routing in carrier-based mobile networks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Modeling and simulation of service composition in opportunistic networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Dissemination in opportunistic social networks: the role of temporal communities
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Efficient reachability query evaluation in large spatiotemporal contact datasets
Proceedings of the VLDB Endowment
Proceedings of the 18th annual international conference on Mobile computing and networking
Understanding and modeling the small-world phenomenon in dynamic networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Efficient routing in carrier-based mobile networks
Theoretical Computer Science
| Hi-index | 0.00 |
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data. Classic studies looked at analysing static or aggregated networks, i.e., networks that do not change over time or built as the results of aggregation of information over a certain period of time. Given the soaring collections of measurements related to very large, real network traces, researchers are quickly starting to realise that connections are inherently varying over time and exhibit more dimensionality than static analysis can capture. In this paper we propose 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 global view. We show how these metrics are able to capture the temporal characteristics of time-varying graphs, such as delay, duration and time order of contacts (interactions), compared to the metrics used in the past on static graphs. We also characterise network reachability with the concepts of in- and out-components. Then, we generalise them with a global perspective by defining temporal connected components. As a proof of concept we apply these techniques to two classes of time-varying networks, namely connectivity of mobile devices and interactions on an online social network.