Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Rank-One Approximation to High Order Tensors
SIAM Journal on Matrix Analysis and Applications
Orthogonal Tensor Decompositions
SIAM Journal on Matrix Analysis and Applications
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On the Bursty Evolution of Blogspace
World Wide Web
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Tensor-CUR decompositions for tensor-based data
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Description and simulation of dynamic mobility networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
IEEE Communications Surveys & Tutorials
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Research challenges towards the Future Internet
Computer Communications
Ego network models for Future Internet social networking environments
Computer Communications
| Hi-index | 0.00 |
Dynamic networks are characterized by topologies that vary with time and are represented by time-graphs. The notion of connectivity in time-graphs is fundamentally different from that in static graphs. End-to-end connectivity is achieved opportunistically by the store-carry-forward paradigm if the network is so sparse that source-destination pairs are usually not connected by complete paths. In static graphs, it is well known that the network connectivity is tied to the spectral gap of the underlying adjacency matrix of the topology: if the gap is large, the network is well connected. In this paper, a similar metric is investigated for time-graphs. To this end, a time-graph is represented by a 3-mode reachability tensor which indicates whether a node is reachable from another node in t steps. To evaluate connectivity, we consider the expected hitting time of a random walk, and the time it takes for epidemic routing to infect all vertices. Observations from an extensive set of simulations show that the correlation between the second singular value of the matrix obtained by unfolding the reachability tensor and these indicators is very significant.