Related papers: Transport in networks with multiple sources and si…
Capacity estimation is an important tool for the design and dimensioning of pedestrian facilities. The literature contains different procedures and specifications which show considerable differences with respect to the estimated flow…
The scientific field of traffic engineering encompasses a rich set of mathematical techniques, as well as researchers with entirely different backgrounds. This paper provides an overview of what is currently the state-of-the-art with…
In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it…
The communication networks in real world often couple with each other to save costs, which results in any network does not have a stand-alone function and efficiency. To investigate this, in this paper we propose a transportation model on…
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and directions are only imposed on them to reduce the danger of…
Network flows and specifically open canal flows can be modeled by systems of balance laws defined on topological graphs. The shallow water or Saint-Venant system of balance laws is one of the most used model and present two phases: fluvial…
Understanding the interactions among nodes in a complex network is of great importance, since they disclose how these nodes are cooperatively supporting the functioning of the network. Scientists have developed numerous methods to uncover…
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…
An excessive demand of vehicles to a motorway bottleneck leads to traffic jams. Motorbikes are narrow and can drive next to each other in a lane, or in-between lanes in low speeds. This paper analyses the resulting traffic characteristics…
Traffic dynamics is universally crucial in analyzing and designing almost any network. This article introduces a novel theoretical approach to analyzing network traffic dynamics. This theory's machinery is based on the notion of traffic…
The generic feature of traffic in a network of flowing electronic data packets is a phase transition from a stationary free-flow phase to a continuously growing congested non-stationary phase. In the most simple network of directed oriented…
It is increasingly common to encounter data from dynamic processes captured by static cross-sectional measurements over time, particularly in biomedical settings. Recent attempts to model individual trajectories from this data use optimal…
Connectivity is a fundamental structural feature of a network that determines the outcome of any dynamics that happens on top of it. However, an analytical approach to obtain connection probabilities between nodes associated to paths of…
Flow of particles of two different species through a narrow channel with solely two discrete spatial positions is analyzed with respect to the species' capability to cooperate or compete for transport. In contrast to mean field approaches,…
Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of the source and drain nodes can affect transport subject to…
We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. Throughout the past decade, they have been…
We consider transport networks with nodes scattered at random in a large domain. At certain local rates, the nodes generate traffic flowing according to some navigation scheme in a given direction. In the thermodynamic limit of a growing…
To better understand the overlapping modular organization of large networks with respect to flow, here we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between…