Related papers: Braess' Paradox in a Generalised Traffic Network
Modern urban resilience is threatened by cascading failures in multimodal transport networks, where localized shocks trigger widespread paralysis. Existing models, limited by their focus on pairwise interactions, often underestimate this…
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such…
Advanced traffic navigation systems, which provide routing recommendations to drivers based on real-time congestion information, are nowadays widely adopted by roadway transportation users. Yet, the emerging effects on the traffic dynamics…
This paper presents a macroscopic fundamental diagram model with volume-delay relationship (MFD-VD) for road traffic networks, by exploring two new data sources: license plate cameras (LPCs) and road congestion indices (RCIs). We derive a…
In this work we investigate time varying networks with complex dynamics at the nodes. We consider two scenarios of network change in an interval of time: first, we have the case where each link can change with probability pt, i.e. the…
During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global…
When comparing new wireless technologies, it is common to consider the effect that they have on the capacity of the network (defined as the maximum number of simultaneously satisfiable links). For example, it has been shown that giving…
Traffic congestion games abstract away from the costs of junctions in transport networks, yet, in urban environments, these often impact journey times significantly. In this paper we equip congestion games with traffic lights, modelled as…
The quantitative study of traffic dynamics is crucial to ensure the efficiency of urban transportation networks. The current work investigates the spatial properties of congestion, that is, we aim to characterize the city areas where…
The property of perfectness plays an important role in the theory of Bayesian networks. First, the existence of perfect distributions for arbitrary sets of variables and directed acyclic graphs implies that various methods for reading…
Load balancing between base stations (BSs) allows BS capacity to be efficiently utilised and avoid outages. Currently, data-driven mechanisms strive to balance inter-BS load and reduce unnecessary handovers. The challenge is that over a…
We present an English translation and discussion of an essay that a Japanese physicist, Torahiko Terada, wrote in 1922. In the essay, he described the waiting-time paradox, also called the bus paradox, which is a known mathematical…
How do networks of relationships evolve over time? We analyse a dataset tracking the social interactions of 900 individuals over four years. Despite continuous shifts in individual relationships, the macroscopic structural properties of the…
Dynamical systems with a network structure can display collective behaviour such as synchronisation. Golubitsky and Stewart observed that all the robustly synchronous dynamics of a network is contained in the dynamics of its quotient…
Varied real world systems such as transportation networks, supply chains and energy grids present coordination problems where many agents must learn to share resources. It is well known that the independent and selfish interactions of…
The classical friendship paradox asserts that, on average, an individual's neighbors have a higher degree than the individual. This statement concerns network-level means and does not describe how often a typical node is locally dominated…
This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…
A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is…
The neural model introduced by Sompolinsky, Crisanti, and Sommers (SCS) nearly four decades ago has become a paradigmatic framework for studying complex dynamics in random recurrent networks. In its original formulation, with balanced…
The friendship paradox in social networks states that your friends have more friends than you do, on average. Recently, a stronger variant of the paradox was shown to hold for most people within a network: `most of your friends have more…