Search arXivSearch

arXiv · 1902.01266

Topological Convergence of Urban Infrastructure Networks

Abstract

Urban infrastructure networks play a major role in providing reliable flows of multitude critical services demanded by citizens in modern cities. We analyzed here a database of 125 infrastructure networks, roads (RN); urban drainage networks (UDN); water distribution networks (WDN), in 52 global cities, serving populations ranging from 1,000 to 9,000,000. For all infrastructure networks, the node-degree distributions, p(k), derived using undirected, dual-mapped graphs, fit Pareto distributions. Variance around mean gamma reduces substantially as network size increases. Convergence of functional topology of these urban infrastructure networks suggests that their co-evolution results from similar generative mechanisms. Analysis of growing UDNs over non-concurrent 40 year periods in three cities suggests the likely generative process to be partial preferential attachment under geospatial constraints. This finding is supported by high-variance node-degree distributions as compared to that expected for a Poisson random graph. Directed cascading failures, from UDNs to RNs, are investigated. Correlation of node-degrees between spatially co-located networks are shown to be a major factor influencing network fragmentation by node removal. Our results hold major implications for the network design and maintenance, and for resilience of urban communities relying on multiplex infrastructure networks for mobility within the city, water supply, and wastewater collection and treatment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher Klinkhamer, Jonathan Zischg, Elisabeth Krueger, Soohyun Yang, Frank Blumensaat, Christian Urich, Thomas Kaeseberg, Kyungrock Paik, Dietrich Borchardt, Julian Reyes Silva, Robert Sitzenfrei, Wolfgang Rauch, Gavan McGrath, Peter Krebs, Satish Ukkusuri, P. S. C. Rao. 2019-02-04. Topological Convergence of Urban Infrastructure Networks. https://arxiv.org/abs/1902.01266

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Self-Organization to the Edge of Ergodicity Breaking in a Complex Adaptive System

Self-organized criticality is widely invoked for collective behavior, yet its role in objective-driven, heterogeneous adaptive systems is unclear. We introduce {\tt EvoSK}: agents learn on a Sherrington--Kirkpatrick landscape while the least fit are replaced. It self-organizes to the edge of ergodicity breaking, with scale-free avalanches ($τ\approx -1.5$) and rewards beating any tuned non-evolutionary regime. Its cascade's branching ratio is the spectral radius of the learning dynamics' Jacobian, making critical branching and ergodicity breaking one marginal-stability condition fixing the exponent. The attraction to criticality follows from the selection--mutation balance: subcritical cascades decay too fast to dislodge frozen agents, supercritical cascades shield them from selection; only the critical power-law tail supplies the polynomial rate the balance requires.

nlin.AO

When higher-order interactions enhance synchronization: the case of the Kuramoto model

Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled oscillators, traditionally assuming pairwise interactions. However, many real-world systems exhibit group and many-body interactions, which can be effectively modeled through hypergraphs. Here we show that the effect of such higher-order interactions on synchronization is non-monotonic. Through a numerical study of higher-order Kuramoto models on random hypergraphs and on globally coupled systems, we find that the degree of synchronization reached from incoherent initial conditions is maximized at a small but nonzero higher-order coupling strength: weak higher-order interactions enhance synchronization when added to pairwise ones, whereas strong ones work against it, in line with earlier reports of reduced basins and of cluster states. We further show, through a cost-constrained allocation analysis, that under a constrained budget for interactions a mixed allocation of pairwise and higher-order couplings consistently achieves higher synchronization than relying on either type alone. These findings clarify the role of higher-order interactions in shaping collective dynamics and point to design principles for optimizing synchronization in complex systems.

nlin.AO

Dynamics-preserving network reductions for ride-pooling paths

Reducing the complexity of ride-pooling paths is a central challenge in systems with distributed demand. Here we show that such dynamics admit an exact coarse-grained representation: for a broad class of routing algorithms whose decisions depend only on path lengths, the full network can be reduced to an effective network of active nodes weighted by shortest-path distances without altering the resulting trajectories, up to stochastic degeneracy breaking. The reduction therefore defines an equivalence class of network representations generating identical path dynamics. We further demonstrate that for globally optimizing dispatchers this equivalence is systematically violated through degeneracy amplification, yet remains quantitatively accurate beyond the exactly solvable regime. Our results identify when spatial structure can be integrated out without loss of dynamical fidelity, providing a general framework for the analysis of interacting path processes.

nlin.AO