The Contact and Mobility Networks of Mexico City
July 29, 2020 Β· Declared Dead Β· + Add venue
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Guillermo de Anda-JΓ‘uregui, Plinio GuzmΓ‘n, Oscar Fontanelli, Amilcar Meneses, Alfredo HernΓ‘ndez, Janeth de Anda-Gil, Marisol Flores Garrido, Maribel HernΓ‘ndez-Rosales
arXiv ID
2007.14596
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
4
Last Checked
4 months ago
Abstract
Mexico City, the largest city in Mexico, is also one of the largest cities in the world. It has over 9 million inhabitants and concentrates the vast majority of government and business centers. In this work we describe algorithms that use anonymized location data from mobile devices to construct Mexico City's contact and mobility networks aiming to help the analysis of the city's complexity by understanding movement and physical interaction patterns between its inhabitants. We show the effectiveness and usefulness of our approach by building networks with data collected in February 2020 and performing a general descriptive analysis on them. We found that contact networks in Mexico City are very sparse, characterized by a largest connected component, and with a heavy-tailed degree distribution. On the other hand, we observed that paths conformed by the highest-degrree nodes of mobility networks resemble Mexico City's street network; moreover, we found interesting qualitative differences in the degree distribution of these networks between weekends and weekdays. We present these results along with the release of contact and mobility networks.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted