Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints

08/30/2019
by   Anne-Sophie Himmel, et al.
0

Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but edge sets changing over time. Importantly, the temporal aspect results in a rich set of optimization criteria for "shortest" walks. Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide a quasi-linear-time algorithm for shortest walk computation that is capable to deal with various optimization criteria and any linear combination of these. A central distinguishing factor to Wu et al.'s work is that our model allows to, motivated by real-world applications, respect waiting-time constraints for vertices, that is, the minimum and maximum waiting time allowed in intermediate vertices of a walk. Moreover, other than Wu et al. our algorithm does not request a strictly increasing time evolvement of the walk and can optimize a richer set of optimization criteria. Our experimental studies indicate that our richer modeling can be achieved without significantly worsening the running time.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/08/2022

Temporal Walk Centrality: Ranking Nodes in Evolving Networks

We propose the Temporal Walk Centrality, which quantifies the importance...
03/29/2021

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Vertex connectivity is a well-studied concept in graph theory with numer...
06/15/2020

Algorithmic Aspects of Temporal Betweenness

The betweenness centrality of a graph vertex measures how often this ver...
07/18/2018

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

We prove new results on lazy random walks on finite graphs. To start, we...
02/19/2018

Towards Improving Brandes' Algorithm for Betweenness Centrality

Betweenness centrality, measuring how many shortest paths pass through a...
11/09/2020

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games

Higher order random walks (HD-walks) on high dimensional expanders have ...
12/09/2019

A Unified Framework of Quantum Walk Search

The main results on quantum walk search are scattered over different, in...