Searcharxiv⌕ Search

subject

cond-mat.stat-mech

cond-mat.stat-mech: explore 27 source-linked works published from 2023 to 2026, with original documents and citations.

This collection is a preview while coverage and quality are evaluated.

Search within this collection

Coverage and selection

Includes records with this source-supplied label or an explicit phrase match in their metadata. Matches indicate a mention, not proof that a paper uses a method or tests a material. Source versions are consolidated by DOI.

Sources: arxiv. Collection updated 2026-09-16. Counts describe this index, not the complete source archives.

A Human-AI Theorem Connecting Spontaneous and Field-Induced Mechanisms of Collective Behavior in One Dimension

Can an artificial intelligence (AI) generate a scientific hypothesis outside a human collaborator's active hypothesis space (AHS), and can human-AI research be organized to make such breakthroughs more likely? We document such a case while proving a theorem that connects two basic organizing mechanisms of statistical physics: collective behavior arising in zero field from competing interactions and that induced or controlled by an external field. A zero-field $O(n)$-vector open chain with arbitrary inhomogeneous nearest- and next-nearest-neighbor interaction functions $U_i(S_i\cdot{S}_{i+1})$ and $V_i(S_i\cdot{S}_{i+2})$ is microscopically, via a temperature-independent mapping at the Hamiltonian level, equivalent to a simpler $O(n)$ open chain with nearest-neighbor interaction $V_i(\boldsymbolσ_i\cdot\boldsymbolσ_{i+1})$ and axial single-spin potential $U_i(σ_i^z)$ for every integer $n\ge1$ and every system size $L\ge1$. The homogeneous linear specialization maps the foundational frustrated $J_1$-$J_2$ model onto the canonical $J$-$h$ field model---with $n=1,2,3$ being the Ising, XY, and Heisenberg classical spin models, respectively; the theorem resolved a longstanding challenge for $n=3$ published in 1990. Its proof was done with an AI-synthesized recursive Householder moving frame and understood via a human-recognized hidden reciprocity. An analogous theorem holds when the continuous $O(n)$ spins are replaced by the $q$-state Potts spins, implying a closed-form exact solution of the $J_1$-$J_2$ standard Potts open chain for every $q\ge2$ and every $L\ge1$. The emergence of these theorems from a human-AI co-development framework suggests that sustained AI involvement throughout a systematic research program may incubate autonomous scientific breakthroughs and make aspects of the discovery process experimentally testable.

cond-mat.stat-mech↗

The thermodynamic freedom of a thermodynamic computer

Thermodynamic computers are stochastic physical devices designed to perform calculations at the thermal energy scale. Their operation is constrained by the equations of stochastic thermodynamics, among which are a set of bounds, known as speed limits, that relate a thermodynamic computer's run time to its computational progress and the heat it dissipates. Using the Wasserstein speed limit we assess the thermodynamic efficiency of a simulation model of a thermodynamic computer trained to perform a standard machine-learning classification task. On this task the thermodynamic computer is as capable as a simple multilayer perceptron. We show that different inference protocols allow the computer to operate within 40\% of the thermodynamic limit of efficiency without loss of accuracy, or to perform inference increasingly rapidly at fixed accuracy and thermodynamic efficiency. These results indicate that a thermodynamic computer designed for a particular task retains considerable freedom in its thermodynamic operation.

cond-mat.stat-mech↗

Emergent aggregation from collective foraging

Collective behaviour in living systems is usually modelled as the outcome of a \emph{direct} social drive: agents are rewarded, or hard-wired, to align with or approach their neighbours. Here we show that aggregation can instead emerge from an \emph{indirect} objective. We let reinforcement learning foragers, initially performing a random walk, optimize their dynamics from a purely individual reward for finding replenishable targets, while perceiving only their conspecifics and never the targets themselves. As the visual range grows, the agents undergo a sharp crossover from an environment-tuned individual search to a scale-agnostic collective one, and this crossover coincides with the onset of spatial aggregation. Thus a collective phase arises as a by-product of optimal foraging, without any direct reward for grouping. A minimal analytical first-passage model reproduces the transition as a crossover between the two search strategies. Our results identify indirect, resource-driven reward as a generic route to emergent collective phenomena.

cond-mat.stat-mech↗

Criticality and universality in network dismantling

Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling.

physics.soc-ph↗

Absence of critical scaling in the Schelling segregation model

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 $r_0 = 6$ ($k = 168$ neighbors). On periodic grids up to $L = 320$ with 50 trials per point (> 12,500 runs), every finite-size scaling diagnostic in the Moore baseline fails: the per-$L$ $T_c$ does not drift, Var$(S) \sim L^{-2.02 \pm 0.09}$ matches trivial averaging, $γ/ν\approx 0$, and the scaling collapse never reaches a finite optimum. The 8-site Moore neighborhood restricts satisfaction to ratios $j/k$ with $k \leq 8$, giving $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)$ 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 $r_0 \in {3,4,5,6}$ on $L \in {40,80,160}$ the Binder cumulant has no $L$-curve crossing and the per-$L$ $T_c$ drift is monotonic and unsaturated; at $r_0 = 4$, extending to $L = 320$ gives $α= -2.70$, below the critical boundary $α= -2$, dissolving an apparent $α= +0.81$ signal visible only on $L \in {40,80}$. The mechanism is the absence of long-range correlation in equilibrium plus deterministic high-$k$ 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.

cond-mat.stat-mech↗

The Role of Pseudo-labels in Self-training Linear Classifiers on High-dimensional Gaussian Mixture Data

Self-training (ST) is a simple yet effective semi-supervised learning method. However, why and how ST improves generalization performance by using potentially erroneous pseudo-labels is still not well understood. To deepen the understanding of ST, we derive and analyze a sharp characterization of the behavior of iterative ST when training a linear classifier by minimizing the ridge-regularized convex loss on binary Gaussian mixtures, in the asymptotic limit where input dimension and data size diverge proportionally. The results show that ST improves generalization in different ways depending on the number of iterations. When the number of iterations is small, ST improves generalization performance by fitting the model to relatively reliable pseudo-labels and updating the model parameters by a large amount at each iteration. This suggests that ST works intuitively. On the other hand, with many iterations, ST can gradually improve the direction of the classification plane by updating the model parameters incrementally, using soft labels and small regularization. It is argued that this is because the small update of ST can extract information from the data in an almost noiseless way. However, in the presence of label imbalance, the generalization performance of ST underperforms supervised learning with true labels. To overcome this, two heuristics are proposed to enable ST to achieve nearly compatible performance with supervised learning even with significant label imbalance.

stat.ML↗

Restoring Sparsity in Potts Machines via Mean-Field Constraints

Ising machines and related probabilistic hardware have emerged as promising platforms for NP-hard optimization and sampling. However, many practical problems involve constraints that induce dense or all-to-all couplings, undermining scalability and hardware efficiency. We address this constraint-induced density through two complementary approaches. First, we introduce a hardware-aware native formulation for multi-state probabilistic digits (p-dits) that avoids the locally dense intra-variable couplings required by binary Ising encodings. We validate p-dit dynamics by reproducing known critical behavior of the 2D Potts model. Second, we propose mean-field constraints (MFC), a hybrid scheme that replaces dense pairwise constraint couplings with dynamically updated single-node biases. Applied to balanced graph partitioning, MFC achieves solution quality comparable to exact all-to-all constraint formulations while dramatically reducing graph density. Finally, we demonstrate the practical impact of restored sparsity through an FPGA implementation. In comparisons using FPGA kernel time and CPU solver-loop time, and excluding the current prototype's host-device schedule transfer overhead, the FPGA reaches the 50% success threshold more than an order of magnitude faster than the CPU probabilistic solvers and more than two orders of magnitude faster than the Tabu Ising baseline. Together, these results outline a pathway for scaling constrained optimization on probabilistic hardware.

cond-mat.stat-mech↗

Spectral origin of the topological gap exponent d + η: mechanism, kernel, decomposition, and scope

The topological gap $Δ$ -- the excess $H_1$ total persistence of a critical point cloud over a density-matched null -- scales as $Δ\sim L^{d+η}$. We derive this analytically: the spectral integral $I(α) = \sum_{k\neq 0} S_{\mathrm{conn}}(k)\,|k|^α$ scales as $L^{2-α-η}$ when IR-dominated, giving $I(-2η) \sim L^{d+η}$. The decomposition $I(-2η) = I_0 \cdot I_{\mathrm{shape}}$ separates volume ($I_0 \propto N(1-m^2) \sim L^d$) from anomalous dimension ($I_{\mathrm{shape}} \sim L^η$); the volume factor accounts for the magnetization-driven per-configuration variance of $Δ$. We prove the mechanism requires $d < 2 + η$ (IR dominance), confining it to $d = 2$ for physical systems; in $d = 3$ the spectral integral is UV-dominated, explaining why density normalization is needed. An $α$-sweep for Potts $q = 4$ at $L = 32$--$256$ finds $α_{\mathrm{opt}}$ in $[-0.75, -0.5]$, consistent with $-2η_{\mathrm{Ising}}$ and inconsistent with $-2η_{q=4} = -1$; we flag this as tentative pending $L \geq 1024$ confirmation. The $\langle m^2 \cdot I(-2η)\rangle$ hyperscaling product is dominated by the correlation $r(m^2, I) \approx -0.98$ via the shared $I_0$ amplitude, so we report it as a covariance-correction analysis. Under a heuristic argument extending Divol--Polonik to inhomogeneous Poisson intensities, the bare PH kernel is flat; the effective kernel acquires $k$-dependence only at criticality. The per-configuration agreement between $Δ$ and $I(-0.5)$ is primarily a magnetization correlation: $R^2 = 0.91$ at $L = 256$ collapses to $R^2 \approx 0$ once $|M|$ is partialed out. Per-configuration evidence corroborates the $I_0$ Parseval identity but not the $|k|^{-2η}$ shape factor; the latter is established by ensemble $L$-scaling.

cs.LG↗

Information geometric bound on general chemical reaction networks

We investigate the dynamics of chemical reaction networks (CRNs) with the goal of deriving an upper bound on their reaction rates. This task is challenging due to the nonlinear nature and discrete structure inherent in CRNs. To address this, we employ an information geometric approach, using the natural gradient, to develop a nonlinear system that yields an upper bound for CRN dynamics. We validate our approach through numerical simulations, demonstrating faster convergence in a specific class of CRNs. This class is characterized by the number of chemicals, the maximum value of stoichiometric coefficients of the chemical reactions, and the number of reactions. We also compare our method to a conventional approach, showing that the latter cannot provide an upper bound on reaction rates of CRNs. While our study focuses on CRNs, the ubiquity of hypergraphs in fields from natural sciences to engineering suggests that our method may find broader applications, including in information science.

physics.chem-ph↗
Compare source metadata on this page

These are bibliographic comparisons, not experimental rankings. Follow the original document for methods and conditions.