Exploring Temporal Networks with Greedy Walks
Jari Saramaki, Petter Holme

TL;DR
This paper investigates the structure of temporal networks using greedy walks, revealing that correlated contact patterns like burst trains significantly influence walk behavior and predictability.
Contribution
It introduces the use of greedy walks as probes to uncover temporal-topological patterns and demonstrates their sensitivity to correlated contact sequences in temporal networks.
Findings
Greedy walks often get trapped in small node sets due to contact correlations.
Burst trains are identified as a dominant factor affecting walk coverage.
Sequences of visited nodes are more predictable in real data than in reference models.
Abstract
Temporal networks come with a wide variety of heterogeneities, from burstiness of event sequences to correlations between timings of node and link activations. In this paper, we set to explore the latter by using greedy walks as probes of temporal network structure. Given a temporal network (a sequence of contacts), greedy walks proceed from node to node by always following the first available contact. Because of this, their structure is particularly sensitive to temporal-topological patterns involving repeated contacts between sets of nodes. This becomes evident in their small coverage per step as compared to a temporal reference model -- in empirical temporal networks, greedy walks often get stuck within small sets of nodes because of correlated contact patterns. While this may also happen in static networks that have pronounced community structure, the use of the temporal reference…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
