pith. sign in

arxiv: 2604.20514 · v1 · submitted 2026-04-22 · 🧮 math.PR · math-ph· math.MP

Macroscopic loops in the random loop model on sparse random graphs

Andreas Klippel This is my paper

Pith reviewed 2026-05-09 22:56 UTC · model grok-4.3

classification 🧮 math.PR math-phmath.MP
keywords random loop modelmacroscopic loopssparse random graphsdrift methodpartition functionloop weightsmall-set sparsityconfiguration model
0
0 comments X

The pith

The random loop model on sparse random graphs has macroscopic loops above an explicit edge-density threshold.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to prove that loops visiting a positive fraction of vertices appear in the random loop model with crosses and bars once the underlying sparse random graph is dense enough. A reader would care because such macroscopic loops are a combinatorial signature of long-range order that arises in statistical-physics models of polymers and quantum circuits. The argument introduces a deterministic drift method that applies to any finite graph and reduces the question to a verifiable small-set sparsity condition on induced edges. The authors check this condition for random regular graphs, sparse Erdős–Rényi graphs, and bounded-degree configuration models, obtaining explicit thresholds in the loop weight θ and cross parameter u. For integer θ the same thresholds upgrade from averaged to pointwise-in-time statements via log-convexity of the partition function.

Core claim

We develop a deterministic drift method on arbitrary finite graphs using a local split–merge–rewire analysis for the loop number, an exact differential identity for the partition function, and a slice estimate that bounds same-loop insertion volume by induced edge counts of small vertex sets; this produces a general criterion in terms of a small-set sparsity condition. We verify the condition for random regular graphs, sparse Erdős–Rényi graphs, and simple bounded-degree configuration models, thereby establishing averaged lower bounds on the probability of a macroscopic loop whenever the edge density exceeds an explicit threshold depending on θ and u. For integer θ, log-convexity upgrades 0.

What carries the argument

The deterministic drift method consisting of local split–merge–rewire analysis for loop count, exact differential identity for the partition function, and slice estimate reducing insertion volume to induced edge counts of small sets; this yields the small-set sparsity criterion on the graph.

If this is right

  • Macroscopic loops exist with positive averaged probability in random regular graphs, sparse Erdős–Rényi graphs, and bounded-degree configuration models above the derived threshold.
  • For integer values of the loop weight θ the lower bounds hold pointwise in time away from the threshold time.
  • The existence of macroscopic loops is controlled by a purely combinatorial sparsity condition on small induced subgraphs.
  • The method supplies explicit, parameter-dependent thresholds rather than merely existential statements.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same drift machinery could be applied to other loop or cycle models on graphs whose local statistics satisfy an analogous sparsity condition.
  • The thresholds may mark the onset of a phase transition whose thermodynamic consequences could be studied via the trace representation for integer θ.
  • One could test whether the small-set sparsity condition holds for other sparse graph families such as power-law degree distributions with suitable cut-offs.

Load-bearing premise

The underlying graph must satisfy the small-set sparsity condition so that the slice estimate controls the same-loop insertion volume.

What would settle it

A Monte-Carlo simulation on a random regular graph of large degree whose average degree lies just above the paper’s explicit threshold yet yields a probability of macroscopic loops that is statistically consistent with zero would contradict the claimed lower bound.

read the original abstract

We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a deterministic drift method on arbitrary finite graphs based on three ingredients: a local split--merge--rewire analysis for the loop number, an exact differential identity for the partition function, and a slice estimate reducing the relevant same-loop insertion volume to induced edge counts of small vertex sets. This yields a general criterion in terms of a small-set sparsity condition on the underlying graph. We then verify this condition for random regular graphs, sparse Erd\H{o}s--R\'enyi graphs, and simple bounded-degree configuration models, obtaining averaged lower bounds on the probability of a macroscopic loop whenever the edge density exceeds an explicit threshold depending on the loop weight \(\theta\) and the cross parameter \(u\). For integer values of \(\theta\), a trace representation of the partition function implies log-convexity, which upgrades the averaged bounds to pointwise-in-time results away from the threshold time.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript develops a deterministic drift method to establish the existence of macroscopic loops (visiting a positive proportion of vertices) in the random loop model with crosses and bars on sparse random graphs. The method combines a local split-merge-rewire analysis for the loop number, an exact differential identity for the partition function, and a slice estimate that reduces same-loop insertion volume to induced edge counts on small vertex sets. This produces a general small-set sparsity criterion on the underlying graph, which is then verified for random regular graphs, sparse Erdős–Rényi graphs, and simple bounded-degree configuration models, yielding explicit edge-density thresholds depending on the loop weight θ and cross parameter u. For integer θ, a trace representation implies log-convexity that upgrades averaged bounds to pointwise-in-time results away from the threshold.

Significance. If the derivations hold, the work supplies a new, deterministic criterion for macroscopic loop formation that applies to arbitrary finite graphs and is explicitly checked on three standard sparse-graph ensembles. The explicit thresholds, the reduction to a verifiable sparsity condition, and the log-convexity upgrade for integer θ constitute concrete, falsifiable advances. These features could extend to other loop or percolation models on random graphs and strengthen the link between local graph properties and global loop statistics.

minor comments (3)
  1. The abstract refers to 'simple bounded-degree configuration models'; the manuscript should explicitly state whether the model allows multiple edges or self-loops and how the sparsity condition is adjusted in each case.
  2. Notation for the slice estimate and the induced-edge-count functional should be introduced with a short display equation in the main text (rather than only in the appendix) to improve readability for readers focused on the general criterion.
  3. The dependence of the explicit threshold on θ and u is stated in the abstract; a brief table or plot summarizing the threshold values for representative integer and non-integer θ would help convey the practical range of the result.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our work, the clear summary of our deterministic drift method, and the recommendation for minor revision. No specific major comments appear in the report, so we have no individual points requiring detailed rebuttal or clarification at this stage. We will perform a careful proofreading pass and address any typographical or minor presentational issues in the revised version.

Circularity Check

0 steps flagged

No significant circularity; derivation is a direct proof reducing to verifiable sparsity

full rationale

The paper's central derivation uses a deterministic drift method on finite graphs via three explicit ingredients: local split-merge-rewire analysis for loop number, an exact differential identity for the partition function, and a slice estimate linking insertion volume to induced edge counts on small sets. This produces a general small-set sparsity criterion that is then directly verified on random regular graphs, sparse ER graphs, and bounded-degree configuration models above an explicit density threshold. For integer θ the log-convexity upgrade follows from a trace representation of the partition function. No step reduces by construction to its inputs via self-definition, fitted parameters renamed as predictions, or load-bearing self-citations; the sparsity condition is both necessary for the slice estimate and independently checked on the target ensembles. The argument is internally self-contained against external graph properties.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof relies on standard properties of random graphs and exact identities for the partition function; no free parameters are fitted to data, no new entities are postulated, and the axioms invoked are background results from probability theory.

axioms (2)
  • standard math Standard properties of sparse random regular graphs, Erdős–Rényi graphs, and configuration models (e.g., local tree-likeness and edge-count concentration).
    Invoked when verifying the small-set sparsity condition for these ensembles.
  • domain assumption Existence of an exact differential identity for the partition function of the loop model.
    Used as one of the three core ingredients of the drift method.

pith-pipeline@v0.9.0 · 5486 in / 1465 out tokens · 29354 ms · 2026-05-09T22:56:58.706122+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 2 canonical work pages

  1. [1]

    Phase transition for the interchange and quantum Heisenberg models on the Hamming graph.Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 57(1):288–313, 2021

    Radoslaw Adamczak, Michal Kotowski, and Piotr Miłoś. Phase transition for the interchange and quantum Heisenberg models on the Hamming graph.Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 57(1):288–313, 2021

    2021

  2. [2]

    Geometric aspects of quantum spin states

    Michael Aizenman and Bruno Nachtergaele. Geometric aspects of quantum spin states. Communications in Mathematical Physics, 164(1):17–63, 1994

    1994

  3. [3]

    Random infinite permutations and the cyclic time random walk.Discrete Mathematics and Theoretical Computer Science, Proceedings, AC:9–16, 2003

    Omer Angel. Random infinite permutations and the cyclic time random walk.Discrete Mathematics and Theoretical Computer Science, Proceedings, AC:9–16, 2003

    2003

  4. [4]

    Decay of correlations in 2D quantum systems with continuous symmetry.Annales Henri Poincaré, 18(9):2831–2847, 2017

    Costanza Benassi, Jürg Fröhlich, and Daniel Ueltschi. Decay of correlations in 2D quantum systems with continuous symmetry.Annales Henri Poincaré, 18(9):2831–2847, 2017

    2017

  5. [5]

    Sharp phase transition for random loop models on trees.Electronic Journal of Probability, 26:1–26, 2021

    Volker Betz, Johannes Ehlert, Benjamin Lees, and Lukas Roth. Sharp phase transition for random loop models on trees.Electronic Journal of Probability, 26:1–26, 2021

    2021

  6. [6]

    Improved bounds for connection probabil- ities in random loop models.Reviews in Mathematical Physics, 2026

    Volker Betz, Andreas Klippel, and Julian Nauth. Improved bounds for connection probabil- ities in random loop models.Reviews in Mathematical Physics, 2026

    2026

  7. [7]

    Björnberg, Michał Kotowski, Benjamin Lees, and Piotr Miłoś

    Jakob E. Björnberg, Michał Kotowski, Benjamin Lees, and Piotr Miłoś. The interchange process with reversals on the complete graph.Journal of Statistical Physics, 180(1–6):474– 506, 2020

    2020

  8. [8]

    Reflection positivity and infrared bounds for quantum spin systems

    Jakob E Björnberg and Daniel Ueltschi. Reflection positivity and infrared bounds for quantum spin systems. InThe Physics and Mathematics of Elliott Lieb, pages 77–108. European Mathematical Society-EMS-Publishing House GmbH, 2022

    2022

  9. [9]

    Infinite cycles in the interchange process in five dimensions

    Dor Elboim and Allan Sly. Infinite cycles in the interchange process in five dimensions. arXiv preprint arXiv:2211.17023, 2024

    work page arXiv 2024

  10. [10]

    Quantum Heisenberg models and their probabilistic representations.Contemporary Mathematics, 552:177–224, 2011

    Christina Goldschmidt, Daniel Ueltschi, and Peter Windridge. Quantum Heisenberg models and their probabilistic representations.Contemporary Mathematics, 552:177–224, 2011

    2011

  11. [11]

    Sharp phase transition in the random stirring model on trees.Probability Theory and Related Fields, 161(3–4):429–448, 2015

    Alan Hammond. Sharp phase transition in the random stirring model on trees.Probability Theory and Related Fields, 161(3–4):429–448, 2015

    2015

  12. [12]

    The probability that a random multigraph is simple.Combinatorics, Probability and Computing, 18(1–2):205–225, 2009

    Svante Janson. The probability that a random multigraph is simple.Combinatorics, Probability and Computing, 18(1–2):205–225, 2009

    2009

  13. [13]

    The random interchange process on the hypercube.Electronic Communications in Probability, 21(4):1–9, 2016

    Roman Kotecký, Piotr Miłoś, and Daniel Ueltschi. The random interchange process on the hypercube.Electronic Communications in Probability, 21(4):1–9, 2016

    2016

  14. [14]

    Perturbation analysis of poisson processes.Bernoulli, 20(2):486–513, 2014

    Günter Last. Perturbation analysis of poisson processes.Bernoulli, 20(2):486–513, 2014

    2014

  15. [15]

    David Mermin and Herbert Wagner

    N. David Mermin and Herbert Wagner. Absence of Ferromagnetism or Antiferromag- netism in One- or Two-Dimensional Isotropic Heisenberg Models.Physical Review Letters, 17(22):1133–1136, 1966

    1966

  16. [16]

    Existence of a phase transition of the interchange process on the Hamming graph.Electronic Journal of Probability, 24:1–21, 2019

    Piotr Miłoś and Batı Şengül. Existence of a phase transition of the interchange process on the Hamming graph.Electronic Journal of Probability, 24:1–21, 2019

    2019

  17. [17]

    MacroscopiccyclesfortheinterchangeandquantumHeisenberg models on random regular graphs.arXiv preprint arXiv:2209.13370, 2022

    RémyPoudevigne-Auboiron. MacroscopiccyclesfortheinterchangeandquantumHeisenberg models on random regular graphs.arXiv preprint arXiv:2209.13370, 2022

    work page arXiv 2022

  18. [18]

    Compositions of random transpositions.Israel Journal of Mathematics, 147(1):221–243, 2005

    Oded Schramm. Compositions of random transpositions.Israel Journal of Mathematics, 147(1):221–243, 2005. 23

    2005

  19. [19]

    Improved lower bound on the thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet.Letters in Mathematical Physics, 28(1):75–84, 1993

    Bálint Tóth. Improved lower bound on the thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet.Letters in Mathematical Physics, 28(1):75–84, 1993

    1993

  20. [20]

    Random loop representations for quantum spin systems.Journal of Mathematical Physics, 54(8):083301, 2013

    Daniel Ueltschi. Random loop representations for quantum spin systems.Journal of Mathematical Physics, 54(8):083301, 2013. 24

    2013