English
Related papers

Related papers: On inefficiently connecting temporal networks

200 papers

Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading…

Physics and Society · Physics 2017-09-19 Mikko Kivelä , Jordan Cambe , Jari Saramäki , Márton Karsai

Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is…

Physics and Society · Physics 2017-11-08 Luis E C Rocha , Naoki Masuda , Petter Holme

Pairwise temporal interactions between entities can be represented as temporal networks, which code the propagation of processes such as epidemic spreading or information cascades, evolving on top of them. The largest outcome of these…

Social and Information Networks · Computer Science 2023-07-12 Rémi Vaudaine , Pierre Borgnat , Paulo Goncalves , Rémi Gribonval , Márton Karsai

Temporal networks representing a stream of timestamped edges are seemingly ubiquitous in the real-world. However, the massive size and continuous nature of these networks make them fundamentally challenging to analyze and leverage for…

Data Structures and Algorithms · Computer Science 2021-01-08 Nesreen K. Ahmed , Nick Duffield , Ryan A. Rossi

Inferring spatial-temporal properties from data is important for many complex systems, such as additive manufacturing systems, swarm robotic systems and biological networks. Such systems can often be modeled as a labeled graph where labels…

Logic in Computer Science · Computer Science 2019-03-26 Zhe Xu , Alexander J Nettekoven , A. Agung Julius , Ufuk Topcu

Finding dense subnetworks, with density based on edges or more complex structures, such as subgraphs or $k$-cliques, is a fundamental algorithmic problem with many applications. While the problem has been studied extensively in static…

Data Structures and Algorithms · Computer Science 2024-06-26 Ilie Sarpe , Fabio Vandin , Aristides Gionis

An accessibility graph of a network contains a link, wherever there is a path of arbitrary length between two nodes. We generalize the concept of accessibility to temporal networks. Building an accessibility graph by consecutively adding…

Physics and Society · Physics 2012-10-09 Hartmut H K Lentz , Thomas Selhorst , Igor M Sokolov

One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random…

Combinatorics · Mathematics 2018-06-26 Gokce Caylak Kayaturan , Alexei Vernitski

A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph. In this paper, we…

Data Structures and Algorithms · Computer Science 2014-01-10 Silu Huang , James Cheng , Huanhuan Wu

In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time-ordering of events. Such temporal paths play a crucial role in dynamic processes.…

Physics and Society · Physics 2011-07-20 Raj Kumar Pan , Jari Saramäki

Many real-world graphs or networks are temporal, e.g., in a social network persons only interact at specific points in time. This information directs dissemination processes on the network, such as the spread of rumors, fake news, or…

Social and Information Networks · Computer Science 2021-08-23 Lutz Oettershagen , Nils M. Kriege , Christopher Morris , Petra Mutzel

In train networks, carefully-chosen delays may be beneficial for certain passengers, who would otherwise miss some connection. Given a simple (directed or undirected) temporal graph and a set of passengers (each specifying a starting…

Data Structures and Algorithms · Computer Science 2025-04-11 David C. Kutner , Anouk Sommer

Temporal graph neural networks (TGNNs) have been widely used for modeling time-evolving graph-related tasks due to their ability to capture both graph topology dependency and non-linear temporal dynamic. The explanation of TGNNs is of vital…

Machine Learning · Computer Science 2022-09-05 Wenchong He , Minh N. Vu , Zhe Jiang , My T. Thai

When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and edge labels, or temporal information. In this paper we are…

Data Structures and Algorithms · Computer Science 2020-07-09 Polina Rozenshtein , Giulia Preti , Aristides Gionis , Yannis Velegrakis

Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been…

Data Structures and Algorithms · Computer Science 2019-11-19 Manuel Fernandez , David P. Woodruff , Taisuke Yasuda

Most instruments - formalisms, concepts, and metrics - for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently…

Social and Information Networks · Computer Science 2011-02-04 Nicola Santoro , Walter Quattrociocchi , Paola Flocchini , Arnaud Casteigts , Frederic Amblard

Temporal networks are commonly used to represent dynamical complex systems like social networks, simultaneous firing of neurons, human mobility or public transportation. Their dynamics may evolve on multiple time scales characterising for…

Physics and Society · Physics 2024-02-27 Elsa Andres , Alain Barrat , Márton Karsai

Temporal networks are widely used to represent a vast diversity of systems, including in particular social interactions, and the spreading processes unfolding on top of them. The identification of structures playing important roles in such…

We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of minimally connected temporal graphs with $n$ vertices and…

Data Structures and Algorithms · Computer Science 2016-02-23 Kyriakos Axiotis , Dimitris Fotakis

Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of…

Data Structures and Algorithms · Computer Science 2022-01-17 Eugen Füchsle , Hendrik Molter , Rolf Niedermeier , Malte Renken
‹ Prev 1 3 4 5 6 7 10 Next ›