Modeling traffic distribution and extracting optimal flows in multilayer networks is of the utmost importance to design efficient, multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and computationally efficient methods to address this problem, but they are mainly focused on modeling single-layer networks. Here, we adapt these results to study how optimal flows distribute on multilayer networks. We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. This is done by means of a parameter that varies with layers, which allows to flexibly tune the sensitivity to the traffic congestion of the various layers. As an application, we consider transportation networks, where each layer is associated to a different transportation system, and show how the traffic distribution varies as we tune this parameter across layers. We show an example of this result on the real, 2-layer network of the city of Bordeaux with a bus and tram, where we find that in certain regimes, the presence of the tram network significantly unburdens the traffic on the road network. Our model paves the way for further analysis of optimal flows and navigability strategies in real, multilayer networks.
Designing and optimizing different flows in networks is a relevant problem in many contexts. While a number of methods have been proposed in the physics and optimal transport literature for the one-commodity case, we lack similar results for the multicommodity scenario. In this paper we present a model based on optimal transport theory for finding optimal multicommodity flow configurations on networks. This model introduces a dynamics that regulates the edge conductivities to achieve, at infinite times, a minimum of a Lyapunov functional given by the sum of a convex transport cost and a concave infrastructure cost. We show that the long-time asymptotics of this dynamics are the solutions of a standard constrained optimization problem that generalizes the one-commodity framework. Our results provide insights into the nature and properties of optimal network topologies. In particular, they show that loops can arise as a consequence of distinguishing different flow types, complementing previous results where loops, in the one-commodity case, were obtained as a consequence of imposing dynamical rules on the sources and sinks or when enforcing robustness to damage. Finally, we provide an efficient implementation of our model which converges faster than standard optimization methods based on gradient descent.
Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions—quantities determining the interaction between passengers—in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers’ fluxes by taking their sum or the sum of their squares. The first choice naturally reflects edges occupancy in transportation networks, however the second guarantees convergence to an optimal configuration of flows. Both modeling choices are applied to the Paris metro. We measure the extent of traffic bottlenecks and infrastructure resilience to node removal, showing that the two settings are equivalent in the congested transport regime, but different in the branched one. In the latter, the two formulations differ on how fluxes are distributed, with one function favoring routes consolidation, thus potentially being prone to generate traffic overload. Additionally, we compare our method to Dijkstra’s algorithm to show its capacity to efficiently recover shortest-path-like graphs. Finally, we observe that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.
Network routing approaches are widely used to study the evolution in time of self-adapting systems. However, few advances have been made for problems where adaptation is governed by time-dependent inputs. In this work we study a dynamical systems where the edge conductivities of a network are regulated by time-varying mass loads injected on nodes. Motivated by empirical observations, we assume that conductivities adapt slowly with respect to the characteristic time of the loads. Furthermore, assuming the loads to be periodic, we derive a dynamics where the evolution of the system is controlled by a matrix obtained with the Fourier coefficients of the input loads. Remarkably, we find a sufficient condition on these coefficients that determines when the resulting network topologies are trees. We show an example of this on the Bordeaux bus network where we tune the input loads to interpolate between loopy and tree topologies. We validate our model on several synthetic networks and provide an expression for long-time solutions of the original conductivities.
5 February 2025 in Journal of The Royal Society Interface
Bicycle infrastructure networks must meet the needs of cyclists to position cycling as a viable transportation choice in cities. In particular, protected infrastructure should be planned cohesively for the whole city and spacious enough to accommodate all cyclists safely and prevent cyclist congestion—a common problem in cycling cities like Copenhagen. Here, we devise an adaptive method for optimal bicycle network design and for evaluating congestion criticalities on bicycle paths. The method goes beyond static network measures, using computationally efficient adaptation rules inspired by optimal transport on the dynamically updating multilayer network of roads and protected bicycle lanes. Street capacities and cyclist flows reciprocally control each other to optimally accommodate cyclists on streets with one control parameter that dictates the preference of bicycle infrastructure over roads. Applying our method to Copenhagen confirms that the city’s bicycle network is generally well-developed. However, we are able to identify the network’s bottlenecks, and we find, at a finer scale, disparities in network accessibility and criticalities between different neighbourhoods. Our model and results are generalizable beyond this particular case study to serve as a scalable and versatile tool for aiding urban planners in designing cycling-friendly cities.
23 April 2024 in Journal of Statistical Mechanics: Theory and Experiment
Hypergraphs are widely adopted tools to examine systems with higher-order interactions. Despite recent advancements in methods for community detection in these systems, we still lack a theoretical analysis of their detectability limits. Here, we derive closed-form bounds for community detection in hypergraphs. Using a message-passing formulation, we demonstrate that detectability depends on the hypergraphs’ structural properties, such as the distribution of hyperedge sizes or their assortativity. Our formulation enables a characterization of the entropy of a hypergraph in relation to that of its clique expansion, showing that community detection is enhanced when hyperedges highly overlap on pairs of nodes. We develop an efficient message-passing algorithm to learn communities and model parameters on large systems. Additionally, we devise an exact sampling routine to generate synthetic data from our probabilistic model. Using these methods, we numerically investigate the boundaries of community detection in synthetic datasets, and extract communities from real systems. Our results extend our understanding of the limits of community detection in hypergraphs and introduce flexible mathematical tools to study systems with higher-order interactions.