English
Related papers

Related papers: Temporal Connectivity: Coping with Foreseen and Un…

200 papers

An example of a time-invariant time-delay system that is uniformly globally attractive and exponentially stable, hence forward complete, but whose reachability sets from bounded initial conditions are not bounded over compact time intervals…

Systems and Control · Electrical Eng. & Systems 2024-02-13 Jose L. Mancilla-Aguilar , Hernan Haimovich

Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after…

Physics and Society · Physics 2015-03-26 Vitor H. P. Louzada , Fabio Daolio , Hans J. Herrmann , Marco Tomassini

When there are significant service disruptions in public transit systems, passengers usually need guidance to find alternative paths. This paper proposes a path recommendation model to mitigate congestion during public transit disruptions.…

Optimization and Control · Mathematics 2025-05-20 Baichuan Mo , Haris N. Koutsopoulos , Max Zuo-Jun Shen , Jinhua Zhao

Accurate and timely travel information is an asset for enhancing passenger travel experience during normal traffic, and for mitigating the discomforts during disruptions. With longer and more frequent disruptions as well as increasing…

Physics and Society · Physics 2025-10-10 Abderrahman Ait-Ali , Anders Peterson

We study a network of coupled logistic maps whose interactions occur with a certain distribution of delay times. The local dynamics is chaotic in the absence of coupling and thus the network is a paradigm of a complex system. There are two…

Chaotic Dynamics · Physics 2009-02-03 Marcelo Ponce , C. Masoller , Arturo C. Marti

Temporal graphs are graphs whose edges are only present at certain points in time. Reachability in these graphs relies on temporal paths, where edges are traversed chronologically. A temporal graph that offers all-pairs reachability is said…

Computational Complexity · Computer Science 2026-04-28 Arnaud Casteigts , Christian Komusiewicz , Nils Morawietz

In this paper we study a property of time-dependent graphs, dubbed path ranking invariance. Broadly speaking, a time-dependent graph is path ranking invariant if the ordering of its paths (w.r.t. travel time) is independent of the start…

Discrete Mathematics · Computer Science 2023-01-05 Tommaso Adamo , Gianpaolo Ghiani , Emanuela Guerriero

In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer,…

Information Theory · Computer Science 2016-06-06 Meng Wang , Juan Liu , Wei Chen

The effect of burstiness in complex networks has received considerable attention. In particular, its effect on temporal distance and delays in the air transportation system is significant owing to their huge impact on our society.…

Physics and Society · Physics 2017-02-08 Hidetaka Ito , Katsuhiro Nishinari

Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…

Physics and Society · Physics 2007-12-05 Luciano da Fontoura Costa

Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the {\em load};…

Computer Science and Game Theory · Computer Science 2018-08-16 Guy Avni , Shibashis Guha , Orna Kupferman

Trajectory prediction is a key element of autonomous vehicle systems, enabling them to anticipate and react to the movements of other road users. Evaluating the robustness of prediction models against adversarial attacks is essential to…

Machine Learning · Computer Science 2025-05-12 Julian F. Schumann , Jeroen Hagenus , Frederik Baymler Mathiesen , Arkady Zgonnikov

We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function…

Computer Science and Game Theory · Computer Science 2015-05-27 Apostolos Bessas , Spyros Kontogiannis , Christos Zaroliagis

Consider a distribution of citizens in an urban area in which some services (supermarkets, post offices...) are present. Each citizen, in order to use a service, spends an amount of time which is due both to the travel time to the service…

Optimization and Control · Mathematics 2008-11-13 Gianluca Crippa , Chloé Jimenez , Aldo Pratelli

Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this…

Data Structures and Algorithms · Computer Science 2016-08-31 Massimo Cairo , Romeo Rizzi

Advances in Micro-Electro-Mechanical Systems (MEMS) have revolutionized the digital age to a point where animate and inanimate objects can be used as a communication channel. In addition, the ubiquity of mobile phones with increasing…

Networking and Internet Architecture · Computer Science 2012-10-04 Zhenxin Feng , Kwan-Wu Chin

Modern manufacturing systems must meet hard delivery deadlines while coping with stochastic task durations caused by process noise, equipment variability, and human intervention. Traditional deterministic schedules break down when reality…

Artificial Intelligence · Computer Science 2025-10-21 Ioan Hedea

Railways are a key infrastructure for any modern country. The reliability and resilience of this peculiar transportation system may be challenged by different shocks such as disruptions, strikes and adverse weather conditions. These events…

Physics and Society · Physics 2018-09-19 Bernardo Monechi , Pietro Gravino , Riccardo di Clemente , Vito D. P. Servedio

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as {\em gathering}. We study deterministic gathering algorithms…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-05-01 Andrzej Pelc

Urban rail transit often operates with high service frequencies to serve heavy passenger demand during rush hours. Such operations can be delayed by two types of congestion: train congestion and passenger congestion, both of which interact…

Systems and Control · Computer Science 2025-09-16 Toru Seo , Kentaro Wada , Daisuke Fukuda