arXiv subjects

Marc Barthelemy

Publications and source records attributed to Marc Barthelemy.

At least 19 recordsLinked to original sources

arXiv2026

Geometry of Urban Order

Urban street networks are modeled as spatial graphs whose geometry reflects planning, history, and physical constraints. Global orientation measures describe the overall order of a city but do not reveal how street directions form coherent neighborhoods. Here we introduce bearings communities---spatially connected domains whose streets share a common orientation---and analyze them using concepts from the physics of polycrystalline materials. Across $1025$ large cities worldwide, these domains are almost perfectly ordered: their mean coherence is $0.964$ and varies by only $1.4\%$ from one city to the next, far above the value expected for randomly oriented streets. Every city is therefore a mosaic of well-ordered orientational grains, differing only in their number, size, and mutual alignment. Because the grains are equally regular everywhere, a city's global order is set mainly by how many of them it averages over: a city appears ordered because it is built from a few large grains, not because its fabric is locally more regular. A null model in which grain orientations are randomized confirms this grain-counting mechanism. Finally, the interface fraction $γ$ measures how strongly domains interlock, yielding a morphology diagram that organizes cities continuously between grid-like, polycrystalline, and fragmented limits.

physics.soc-ph↗

arXiv2026

Crowding controls the scaling of bus frequency with demand

Cities must allocate limited resources to maintain mobility, with uncertainties about the resulting state of the system. Analyzing roughly 3,000 bus routes with more than 4 billion yearly riders across 19 metropolitan areas worldwide, we uncover a robust scaling law of the form $f \sim (d/t)^α$ with exponent $α\in [1/2,\,2/3]$, linking the service frequency $f$ to passenger demand $d$ and route duration $t$. We show that this scaling emerges from a simple optimization principle: cities implicitly minimize total passenger waiting time under a fixed operational budget when both schedule frequency and crowding are taken into account. This mechanism produces two universal regimes: a frequency-dominated regime with $α= 1/2$ when crowding is negligible, and a capacity-dominated regime with $α= 2/3$ when most routes are overloaded. Intermediate exponents arise when only part of the network operates near capacity. Furthermore, we find that the benefits of additional investment are highly uneven across systems. For instance, our model suggests that a $20\%$ budget increase yields nearly a 5-minute reduction in daily waiting time per passenger in Boston, compared to only about 1 minute in Paris. These findings place urban transit within a broader class of constrained capacity-allocation problems, while highlighting a distinct regime in which prescribed route demands shape the allocation of limited service resources. The resulting scaling laws show how simple optimization principles can generate systematic exponents in complex transport systems, beyond the dissipation-based frameworks usually considered in physical and biological flow networks.

physics.soc-ph↗

arXiv2026

Beyond dynamic scaling: rare events break universality

Surface growth driven by non-monomeric deposition has remained largely unexplored. We investigate a model based on the deposition of blobs with a power-law size distribution $P(s)\sim s^{-τ}$. We find that the critical exponents vary continuously with $τ$, recovering Kardar--Parisi--Zhang behavior only for $τ\ge 3$. For $τ<3$, roughness scaling exhibits strong corrections and scale invariance breaks down. We show that this behavior originates from the emergence of a second dynamical length scale $ζ$, corresponding to the linear size of the largest cluster, in addition to the usual correlation length $ξ$. The coexistence of these two relevant scales signals the breakdown of the usual Family--Vicsek scaling. These results point to a new phenomenology of surface growth beyond the standard scale-invariant paradigm.

cond-mat.stat-mech↗

arXiv2026

On the Meaning of Urban Scaling

Cities are often compared through scaling laws, usually expressed as power-law relations between population size and aggregate urban quantities related to infrastructure, socioeconomic activity, or environmental impacts. These laws are influential because their exponent is often interpreted as describing what happens when a city grows, with implications for urban theory, planning, and policy. Here, we show that this interpretation is generally misleading. An exponent measured by comparing many cities at one date does not, in general, describe the trajectory of any individual city. Instead, it reflects a statistical pattern produced by cities with different histories, constraints, institutions, and growth paths. Apparent sublinear or superlinear scaling can therefore arise even when individual cities follow simpler dynamics, as we show for the area--population relation. Cross-sectional scaling laws can reveal system-level regularities, but should not be used alone to infer growth mechanisms or guide policy for a given city.

physics.soc-ph↗

arXiv2026

FKPP fronts in quenched random media

We study numerically the evolution of one-dimensional FKPP fronts initiated from steep initial conditions in the presence of a quenched random growth rate. Compared to both the homogeneous case (with velocity $v_0$) and deterministic disorder, quenched randomness increases the average propagation speed. We show that the velocity shift relative to the homogeneous case scales linearly with the disorder variance $σ^2$, with a universal prefactor -- independent of the specific distribution of the disorder -- such that $v = v_0 + a σ^2$, with $a \approx 0.02432 \pm 0.00002$. Moreover, the front position exhibits diffusive fluctuations across disorder realizations. The corresponding effective diffusion coefficient scales quadratically with $σ$, $D = \frac{b^2 σ^2}{2}$, with $b \approx 0.223 \pm 0.002$. These results suggest a universal statistical response of FKPP fronts to quenched heterogeneity.

cond-mat.dis-nn↗

arXiv2026

The dynamics of discovery and the Heaps-Zipf relationship

When following a sequence - such as reading a text or tracking a user's activity - one can measure how the "dictionary" of distinct elements (types) grows with the number of observations (tokens). When this growth follows a power law, it is referred to as Heaps' law, a regularity often associated with Zipf's law and frequently used to characterize human discovery processes. While random sampling from a Zipf-like distribution can reproduce Heaps' law, this connection relies on the assumption of temporal independence - an assumption often violated in real-world systems although frequently found in the literature. Here, we investigate how temporal correlations in token sequences affect the type-token curve. In human behaviors like music listening and web browsing, domain-specific correlations in token ordering lead to systematic deviations from the Zipf-Heaps framework, effectively decoupling the type-token plot from the rank-frequency distribution. Using a minimal one-parameter model, we reproduce a wide variety of type-token trajectories, including the extremal cases that bound all possible behaviors compatible with a given frequency distribution. Our results demonstrate that type-token growth reflects not only the empirical distribution of type frequencies, but also the domain-specific, temporal structure of the sequence - a factor often overlooked in empirical applications of scaling laws to characterize human behavior.

physics.soc-ph↗

arXiv2026

Modeling the spatial growth of cities

The growth of cities has traditionally been studied from a population perspective, while urban expansion-its spatial growth-has often been approached qualitatively. However, characterizing and modeling this spatial expansion is crucial, particularly given its parallels with surface growth extensively studied in physics. Despite these similarities, approaches to urban expansion modeling are fragmented and scattered across various disciplines and contexts. In this review, we provide a comprehensive overview of the mathematical modeling of this complex phenomenon. We discuss the key challenges hindering progress and examine models inspired by statistical physics, economics and geography, and theoretical ecology. Finally, we highlight critical directions for future research in this interdisciplinary field.

physics.soc-ph↗

arXiv2026

Why urban heterogeneity limits the 15-minute city

The `15-minute city' has emerged as a central paradigm in urban planning, promoting universal access to work and essential services within short travel times. Its feasibility-particularly for commuting to work-has however rarely been examined quantitatively. Here, we show that proximity to employment is fundamentally constrained by the internal structure of urban economies. Combining urban geometry with empirically observed firm-size distributions, we derive a lower bound on commuting times that holds independently of planning choices or transport technologies. This bound reveals a sharp transition: when employment is sufficiently concentrated, no spatial rearrangement of workplaces can ensure uniformly short commutes, even under optimal placement. Applied to Paris and its near suburbs, we find that achieving universal 15-minute commutes would require substantial economic restructuring or differentiated mobility strategies. The relevant question is therefore not whether an $x$-minute city is achievable, but what the minimal feasible $x$ is given a city's economic structure and spatial scale.

physics.soc-ph↗

arXiv2026

Not all Chess960 positions are equally complex

We analyze strategic complexity across all 960 Chess960 (Fischer Random Chess) starting positions. Stockfish evaluations reveal a near-universal first-move advantage for White ($\langle E \rangle = +0.33 \pm 0.12$ pawns), indicating that the initiative is a robust structural feature of the game. To quantify decision difficulty, we introduce an information-based measure $S(n)$ that captures the cumulative information required to identify optimal moves over the first $n$ plies. This measure decomposes into White and Black contributions, $S_W$ and $S_B$, defining a total opening complexity $S_{\mathrm{tot}} = S_W + S_B$ and a decision asymmetry $A = S_B - S_W$. Across the ensemble, $S_{\mathrm{tot}}$ ranges from $2.6$ to $17.2$ bits, while $A$ spans from $-4.5$ to $+4.2$ bits (mean $\langle A \rangle = -0.26$), showing that openings are nearly evenly split between those that burden White and those that burden Black, with a slight average excess complexity for White. Standard chess (position \#518, \texttt{RNBQKBNR}) exhibits near-average total complexity and asymmetry, yet lies far from the configuration that jointly minimizes evaluation imbalance and decision asymmetry. These results reveal a highly heterogeneous Chess960 landscape in which small rearrangements of back-rank pieces can substantially alter strategic depth and competitive balance. The classical starting position--despite centuries of refinement--appears not as an extremum, but as one configuration among many in a broad statistical ensemble.

physics.soc-ph↗

arXiv2026

Mathematical modeling of urban sprawl

Urban land cover doubled between 1985 and 2015, yet the spatial dynamics of urban form remain under-quantified, despite its importance for sustainability, infrastructure planning, and climate risk. Urban expansion is a non-equilibrium process shaped by interactions between population growth, infrastructure, institutions, and market failures -- rendering static and equilibrium models inadequate. We review key challenges and modeling approaches, focusing on partial differential equation (PDE) frameworks. Borrowed from statistical physics, PDEs capture spatial heterogeneity, anisotropy, stochasticity, and feedbacks between land use and transport networks. Integrating economic and institutional factors remains a major challenge for policy relevance. We propose a research agenda that bridges remote sensing, urban economics, and complexity science to develop dynamic, empirically grounded models of urban expansion.

physics.soc-ph↗

arXiv2025

Universal roughness and the dynamics of urban expansion

Urban sprawl reshapes cities, yet its quantitative laws remain elusive. Analyzing built-up expansion in 19 cities (1985-2015) with tools from surface growth physics in radial geometry, we reveal anisotropic, branch-like growth and a piecewise linear scaling between area and population. We uncover a robust local roughness exponent $α_{\text{loc}}\approx 0.54$, coexisting with variable $β$ and $z$. This unusual coexistence of universal and variable exponents offers a rare empirical testbed for nonequilibrium growth and an empirical basis for modeling urban sprawl.

physics.soc-ph↗

arXiv2025

Universal Model of Urban Street Networks

Analyzing 9,000 urban areas' street networks, we identify properties, including extreme betweenness centrality heterogeneity, that typical spatial network models fail to explain. Accordingly we propose a universal, parsimonious, generative model based on a two-step mechanism that begins with a spanning tree as a backbone then iteratively adds edges to match empirical degree distributions. Controlled by a single parameter representing lattice-equivalent node density, it accurately reproduces key universal properties to bridge the gap between empirical observations and generative models.

physics.soc-ph↗

arXiv2025

From lines to networks

Many real-world networks, ranging from subway systems to polymer structures and fungal mycelia, do not form by the incremental addition of individual nodes but instead grow through the successive extension and intersection of lines or filaments. Yet most existing models for spatial network formation focus on node-based growth, leaving a significant gap in our understanding of systems built from spatially extended components. Here we introduce a minimal model for spatial networks, rooted in the iterative growth and intersection of lines-a mechanism inspired by diverse systems including transportation networks, fungal hyphae, and vascular structures. Unlike classical approaches, our model constructs networks by sequentially adding lines across a domain populated with randomly distributed points. Each line grows greedily to maximize local coverage, while subject to angular continuity and the requirement to intersect existing structures. This emphasis on extended, interacting elements governed by local optimization and geometric constraints leads to the spontaneous emergence of a core-and-branches architecture. The resulting networks display a range of non-trivial scaling behaviors: the number of intersections grows subquadratically; Flory exponents and fractal dimensions emerge consistent with empirical observations; and spatial scaling exponents depend on the heterogeneity of the underlying point distribution, aligning with measurements from subway systems. Our model thus captures key organizational features observed across diverse real-world networks, establishing a universal paradigm that goes beyond node-based approaches and demonstrates how the growth of spatially extended elements can shape the large-scale architecture of complex systems.

physics.soc-ph↗

arXiv2025

Critical demand in a stochastic model of flows in supply networks

Supply networks are essential for modern production, yet their critical properties remain understudied. We present a stochastic model with random production capacities to analyze material flow to a root node, focusing on topology and buffer stocks. The critical demand, where unsatisfied demand diverges, is examined mostly through numerical simulations. Without stocks, minimal production dictates behavior, making topology irrelevant. With stocks, memory effects arise, making topology crucial. Increased local connectivity is beneficial: firms should favor broad, short supply chains over long, narrow ones.

physics.soc-ph↗

arXiv2025

Chess variation entropy and engine relevance for humans

Modern chess engines significantly outperform human players and are essential for evaluating positions and move quality. These engines assign a numerical evaluation $E$ to positions, indicating an advantage for either white or black, but similar evaluations can mask varying levels of move complexity. While some move sequences are straightforward, others demand near-perfect play, limiting the practical value of these evaluations for most players. To quantify this problem, we use entropy to measure the complexity of the principal variation (the sequence of best moves). Variations with forced moves have low entropy, while those with multiple viable alternatives have high entropy. Our results show that, except for experts, most human players struggle with high-entropy variations, especially when $|E|<100$ centipawns, which accounts for about $2/3$ of positions. This underscores the need for AI-generated evaluations to convey the complexity of underlying move sequences, as they often exceed typical human cognitive capabilities, reducing their practical utility.

physics.soc-ph↗

arXiv2025

Surfacic networks

Surfacic networks are structures built upon a two-dimensional manifold. Many systems, including transportation networks and various urban networks, fall into this category. The fluctuations of node elevations imply significant deviations from typical plane networks and require specific tools to understand their impact. Here, we present such tools, including lazy paths that minimize elevation differences, graph arduousness which measures the tiring nature of shortest paths, and the excess effort, which characterizes positive elevation variations along shortest paths. We illustrate these measures using toy models of surfacic networks and empirically examine pedestrian networks in selected cities. Specifically, we examine how changes in elevation affect the spatial distribution of betweenness centrality. We also demonstrate that the excess effort follows a non-trivial power law distribution, with an exponent that is not universal, which illustrates that there is a significant probability of encountering steep slopes along shortest paths, regardless of the elevation difference between the starting point and the destination. These findings highlight the significance of elevation fluctuations in shaping network characteristics. Surfacic networks offer a promising framework for comprehensively analyzing and modeling complex systems that are situated on or constrained to a surface environment.

physics.soc-ph↗

arXiv2025

A Stochastic Block Hypergraph model

The stochastic block model is widely used to generate graphs with a community structure, but no simple alternative currently exists for hypergraphs, in which more than two nodes can be connected together through a hyperedge. We discuss here such a hypergraph generalization, based on the clustering connection probability $P_{ij}$ between nodes of communities $i$ and $j$, and that uses an explicit and modulable hyperedge formation process. We focus on the standard case where $P_{ij}=pδ_{ij}+q(1-δ_{ij})$ when $0\leq q\leq p$. We propose a simple model that satisfies three criteria: it should be as simple as possible, when $p = q$ the model should be equivalent to the standard hypergraph random model, and it should use an explicit and modulable hyperedge formation process so that the model is intuitive and can easily express different real-world formation processes. We first show that for such a model the degree distribution and hyperedge size distribution can be approximated by binomial distributions with effective parameters that depend on the number of communities and $q/p$. Also, the composition of hyperedges goes for $q=0$ from `pure' hyperedges (comprising nodes belonging to the same community) to `mixed' hyperedges that comprise nodes from different communities for $q=p$. We test various formation processes and our results suggest that when they depend on the composition of the hyperedge, they tend to favor the dominant community and lead to hyperedges with a smaller diversity. In contrast, for formation processes that are independent from the hyperedge structure, we obtain hyperedges comprising a larger diversity of communities. The advantages of the model proposed here are its simplicity and flexibility that make it a good candidate for testing community-related problems, such as their detection, impact on various dynamics, and visualization.

physics.soc-ph↗

arXiv2024

Fragility of Chess positions: measure, universality and tipping points

We introduce a novel metric to quantify the fragility of chess positions using the interaction graph of pieces. This fragility score $F$ captures the tension within a position and serves as a strong indicator of tipping points in a game. In well-known games, maximum fragility often aligns with decisive moments marked by brilliant moves. Analyzing a large dataset of games, we find that fragility typically peaks around move $15$, with pawns ($\approx 60\%$) and knights ($\approx 20\%$) frequently involved in high-tension positions. Comparing the Stockfish evaluation with the fragility score, we observe that the maximum fragility ply often serves as a critical turning point, where the moves made afterward can determine the outcome of the game. Remarkably, average fragility curves show a universal pattern across a wide range of players, games, and openings, with a subtle deviation observed in games played by the engine Stockfish. Our analysis reveals a gradual buildup of fragility starting around $8$ moves before the peak, followed by a prolonged fragile state lasting up to $15$ moves. This suggests a gradual intensification of positional tension leading to decisive moments in the game. These insights offer a valuable tool for both players and engines to assess critical moments in chess.

physics.soc-ph↗