This study applies a Neighbor-Limited Box Covering method to renormalize undirected weighted mobility networks in China and finds that the topological structures, weighted structural features, and dynamic processes all exhibit self-similarity across these multi-scale mobility networks.
Abstract
Mobility systems of people and goods are inherently multi-scale, spanning levels of organization from individual cities to regions and nations. Understanding whether mobility networks exhibit similar patterns across these scales is important. Such similarity would point to common organizing principles, enabling insights gained at one scale to inform planning and management at others. Despite growing efforts to analyze mobility at multiple scales, such cross-scale similarity remains poorly understood, and renormalization provides a natural framework for addressing this question. Here, we propose a Neighbor-Limited Box Covering method to renormalize undirected weighted mobility networks. This method iteratively selects box centers in descending order of node strength, merges each center with a fixed number of its highest-weight neighbors to form a renormalized node, and aggregates edge weights between renormalized nodes to generate the network at the next scale. We apply this technique to uncover multi-scale structures of real-world inter-city human mobility and freight trip networks in China and find that the topological structures, weighted structural features, and dynamic processes all exhibit self-similarity across these multi-scale mobility networks. Moreover, we find that the constituent nodes in most renormalized nodes show a strong spatial cohesion, and the boundaries of them closely follow existing political and socio-economic borders, even though the method does not explicitly incorporate any spatial information. Our study not only reveals the consistency of multi-scale inter-city mobility patterns, but also provides important insights into their spatial organization. Furthermore, our method is applicable to mobility networks of different sizes and has potential as a powerful tool for the multi-scale analysis of various other real-world complex systems.
Abstract Cities are held together by a small subset of recurrent origin–destination ties, but extracting this backbone from noisy mobility data remains difficult, and most models still prioritize distance over connectivity. We build directed mobility networks from 48 months of mobile-phone data across eight US cities (...
Wei-Yu Zhang, Fu-Rong Jia, Jianying Wang et al.· Royal Society Open Science· 0 citations
Cities are commonly characterized through population density, infrastructure, and mobility flows. These quantities describe where people are and how they move, but movement does not uniquely determine where populations repeatedly encounter one another or whether different locations participate in the same social enviro...
Bibandhan Poudyal, Mariana Macedo, Ronaldo Menezes et al.· 0 citations
While the local clustering coefficient is central to network analysis, it is typically treated as a static property. We introduce delta clustering to quantify changes in an individual's local clustering across adjacent time points in undirected networks. To address structural constraints, we develop a density-based dec...
Cheng Wang, Omar Lizardo, David S. Hachen· Sociological Methods & R...· 0 citations
Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastica...
Kai Bergermann, Francesco Gravili, V. Simoncini et al.· 0 citations
It is shown that process mining and network science are complementary: process mining yields structured event representations and modal sequencing, while network science offers robust tools for structural comparison.
Khristina Filonchik, J. D. Pinto, Flávio L. Pinheiro et al.· Applied Network Science· 0 citations
A weighted multiscale model whose full probability law, encoding both link creation and weight assignment, has an invariant compound-Poisson form under arbitrary node aggregation is identified, enabling consistent modeling and reconstruction of weighted networks across arbitrary scales.
Mattia Marzi, F. Pijpers, Diego Garlaschelli· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.