cond-mat.stat-mechAug 17, 2026

Absence of critical scaling in the Schelling segregation model

Authors: Mouhssine Rifaki

Organizations: Stanford University, Stanford, CA 94305, USA

Abstract

We find no evidence of critical scaling in the Schelling segregation model, in either the Moore neighborhood or its dense-spectrum extension to Chebyshev radii up to r0=6r_0 = 6 (k=168k = 168 neighbors). On periodic grids up to L=320L = 320 with 50 trials per point (> 12,500 runs), every finite-size scaling diagnostic in the Moore baseline fails: the per-LL TcT_c does not drift, Var(S)∼L−2.02±0.09(S) \sim L^{-2.02 \pm 0.09} matches trivial averaging, γ/ν≈0γ/ν\approx 0, and the scaling collapse never reaches a finite optimum. The 8-site Moore neighborhood restricts satisfaction to ratios j/kj/k with k≤8k \leq 8, giving S(T)S(T) a staircase structure with 23 rational thresholds; discreteness alone does not forbid criticality (cf. the Ising model), but the scaling evidence rules it out empirically. A branching-ratio calculation predicts subcritical cascades of mean size 1/(1−R)1/(1-R) and is validated by perturbation experiments to within 15%; the multiscalar dissimilarity length stays finite across the transition. The dense-spectrum extension strengthens the negative verdict: across r0∈3,4,5,6r_0 \in {3,4,5,6} on L∈40,80,160L \in {40,80,160} the Binder cumulant has no LL-curve crossing and the per-LL TcT_c drift is monotonic and unsaturated; at r0=4r_0 = 4, extending to L=320L = 320 gives α=−2.70α= -2.70, below the critical boundary α=−2α= -2, dissolving an apparent α=+0.81α= +0.81 signal visible only on L∈40,80L \in {40,80}. The mechanism is the absence of long-range correlation in equilibrium plus deterministic high-kk dynamics, not the staircase structure. With a Beta-distributed heterogeneous tolerance, the intolerant tail drives segregation even at moderate population-average tolerance. The staircase theorem and cascade mechanism together account for the Schelling transition without invoking critical phenomena.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Apr 1, 2026

The topological gap at criticality: scaling exponent d + η, universality, and scope

The topological gap Δ=TPH1real−TPH1shufΔ= TP_{H_1}^{real} - TP_{H_1}^{shuf} -- the excess H1H_1 total persistence of the majority-spin alpha complex over a density-matched null -- encodes critical correlations in spin models. We establish finite-size scaling: Δ(L,T)=ALd+ηG−(L∣t/Tc∣)Δ(L,T) = A L^{d+η} G_-(L|t/T_c|), with G−(x)∼(1+x/x0)−(1+β/ν)G_-(x) \sim (1+x/x_0)^{-(1+β/ν)}. For 2D Ising, α=2.249±0.038α= 2.249 \pm 0.038, matching d+η=9/4d+η= 9/4 to 0.03σ0.03σ; the G−G_- exponent γ=1.089±0.077γ= 1.089 \pm 0.077 is consistent with 1+β/ν=9/81+β/ν= 9/8 (ΔR2<10−5ΔR^2 < 10^{-5}). For 2D Potts q=3q=3 with LL up to 1024, α=2.272±0.024α= 2.272 \pm 0.024 (0.2σ0.2σ from d+η=2.267d+η= 2.267), with two-term corrections to scaling (R2=0.9999R^2 = 0.9999). The G−G_- exponent γ=1.114γ= 1.114 (68% CI [1.053,1.173][1.053, 1.173]) matches 1+β/ν=17/151+β/ν= 17/15. Scope boundaries: the law fails for 2D Potts q=4q=4 (α=2.347±0.017α= 2.347 \pm 0.017, 9.3σ9.3σ from d+η=5/2d+η= 5/2) where logarithmic corrections prevent convergence, and for raw 3D Ising (4σ4σ from d+ηd+η), but density normalization Δ/∣M∣1/2Δ/|M|^{1/2} recovers α=3.06±0.04α= 3.06 \pm 0.04 (0.6σ0.6σ). The framework fails for first-order, BKT, and percolation. The criterion: α=d+ηα= d+η holds when corrections to scaling are algebraic (ω>0ω> 0) but fails when logarithmic (ω→0ω\to 0).
Jul 5, 2025

Siamese Neural Network for Label-Efficient Critical Phenomena Prediction in 3D Percolation Models

Predicting critical phenomena from limited labeled data remains a challenging task in statistical physics. As percolation theory provides a canonical model for phase transitions with well-established critical exponents, it serves as an ideal benchmark for validating new machine learning frameworks. Here, we introduce a label-efficient learning framework based on a Siamese Neural Network (SNN) to identify phase transitions in three-dimensional site and bond percolation models. Using only 22 labeled probability points drawn entirely from non-critical regions, the method locates percolation thresholds with percent-level accuracy and yields estimates of the critical exponent νν consistent with literature values within statistical uncertainty. Analysis of the learned representations clarifies what the network learns: although trained solely on binary similarity labels, the network autonomously converges to a statistic that coincides quantitatively with the normalized largest-cluster size Smax/L3S_{max}/L^3 (r>0.99r > 0.99), the finite-size order parameter of percolation. This underlies the framework's most distinctive capability -- a model trained solely on simple cubic lattices identifies the phase transition in face-centered cubic lattices without retraining. The framework thus offers a complementary route to criticality detection in settings where no quantitative order parameter is explicitly defined or labeled data is scarce.
Aug 7, 2026

Mobility, Memory, and Network Structure in Agent-Based Models of Convention Tipping and Convergence

Tipping-point dynamics describe the critical conditions under which a committed minority drives a population to abandon an established convention in favor of a new one. We present a transparent agent-based model of this process, in which agents hold one of two behavioral states and a mobile committed minority attempts to overturn the incumbent convention. Our goal was to examine how localized mobility, bounded agent memory, and network topology jointly influence the tipping threshold. Using a custom agent-based simulation framework, we found that in many configurations, tipping becomes effectively inevitable: given sufficient time, the population always converges to the minority state. This observation motivated a complementary analysis focused on the pace of convergence rather than its feasibility. We introduce a unified predictive model that accurately estimates how structural and behavioral parameters determine the time required for complete adoption, showing that mobility is the dominant accelerator while memory and connectivity modulate convergence in systematic ways. Together, these results extend classical tipping-point research by linking structural and behavioral factors not only to the likelihood of convention change but also to the timescale on which it unfolds. While we frame the model in terms of convention-like binary behavioral adoption, the same mechanisms bear on norm change and other contagion-like social processes.