On Equilibrium Metropolis Simulations on Self-Organized Urban Street Networks
Jerome Benoit, Saif Eddin Jabari

TL;DR
This paper introduces a Metropolis algorithm adapted for self-organized urban street networks, revealing their scale-free properties and small-world crossover, with implications for understanding urban evolution.
Contribution
It develops a novel Metropolis simulation framework for self-organized urban street networks based on maximum entropy principles and scale-freeness, bridging urban modeling and statistical physics.
Findings
Self-organized street networks sustain scale-freeness across various scales.
Simulations show a small-world crossover in urban street networks.
The model aligns with real data from Central London.
Abstract
Urban street networks of unplanned or self-organized cities typically exhibit astonishing scale-free patterns. This scale-freeness can be shown, within the maximum entropy formalism (MaxEnt), as the manifestation of a fluctuating system that preserves on average some amount of information. Monte Carlo methods that can further this perspective are cruelly missing. Here we adapt to self-organized urban street networks the Metropolis algorithm. The "coming to equilibrium" distribution is established with MaxEnt by taking scale-freeness as prior hypothesis along with symmetry-conservation arguments. The equilibrium parameter is the scaling; its concomitant extensive quantity is, assuming our lack of knowledge, an amount of information. To design an ergodic dynamics, we disentangle the state-of-the-art street generating paradigms based on nonoverlapping walks into layout-at-junction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
