Pith. sign in

REVIEW 4 minor 34 references

Zero-temperature stochastic Ising model on one-dimensional quasi-transitive graphs

T0 review · 0 major / 4 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Zero-temperature Ising dynamics on one-dimensional quasi-transitive graphs fluctuate forever exactly when the graph has the shrink property, and the three possible long-time regimes are algorithmically decidable.

desk verdict Clean, complete classification of zero-temperature Ising dynamics on 1D quasi-transitive graphs, with a genuine finite decision procedure for the three classical types. read the letter →

arxiv 2607.08330 v1 pith:7NTSJTXW submitted 2026-07-09 math.PR math-phmath.MP

Emilio De Santis This is my paper · ORCID
classification math.PRmath-phmath.MP MSC 82C2082C2237B1568Q05
keywords CoarseningZero-temperaturedynamicsQuasi-transitivegraphsDecidabilityAsynchronouscellularautomataGlauberShrinkpropertyBlinkers
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper classifies the long-time fate of zero-temperature majority spin-flip dynamics on infinite one-dimensional graphs that are invariant under a fixed translation and have finite interaction range. It proves that every site flips infinitely often almost surely if and only if the graph satisfies the shrink property: every finite set of vertices contains at least one vertex that is connected at least as strongly outside the set as inside it. When the shrink property fails, finite stable walls form and the dynamics fall into either complete local fixation or a mixed regime containing both frozen sites and perpetual zero-energy blinkers; which of the two occurs is decided by a finite enumeration of admissible configurations trapped between walls. The same geometric criteria remain valid under fast cooling to zero temperature, and an explicit construction produces blinkers of arbitrarily large size. The result therefore supplies a complete, computable phase diagram for any such graph.

What carries the argument

The shrink property (equivalently, right- and left-deformability of every minimal infinite cut-set) together with the finite set A_N of admissible configurations confined between two fixed stable walls; the former decides Type I, while exhaustive inspection of A_N decides Type M versus Type F.

What would settle it

Produce a concrete one-dimensional quasi-transitive graph that possesses the shrink property yet, under product initial measure of density 1/2, has a positive-density set of sites that fixate almost surely; or exhibit a graph already known to be Type I (for example the ordinary integer line) that the greedy exploration algorithm incorrectly reports as lacking the shrink property.

Watch

Extended reading notes

Core claim

For any one-dimensional quasi-transitive graph G of finite range, the zero-temperature Ising process at density 1/2 is of Type I (every vertex flips infinitely often) if and only if G has the shrink property. When the shrink property is absent the process is of Type M or Type F according as a finite, explicitly bounded set of admissible confined configurations contains a zero-energy flip; the distinction is algorithmically decidable in finite time.

Load-bearing premise

The proof that the shrink property forces perpetual flipping of every site relies on the symmetric initial density one-half and the FKG inequality to guarantee that favorable monochromatic boundaries of fixed width recur infinitely often.

Editorial extensions

If this is right

  • Any finite description of a one-dimensional quasi-transitive graph can be fed to an algorithm that returns whether the zero-temperature dynamics are Type I, Type F or Type M.
  • When the shrink property fails the asymptotic regime is independent of the initial density p in (0,1).
  • Blinkers need not be microscopic: graphs exist that support zero-energy fluctuating clusters of arbitrarily large finite size.
  • The geometric classification remains valid for any temperature schedule that cools to zero sufficiently fast that the total number of energy-increasing flips is almost surely finite.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The finite-check criterion suggests that analogous cut-set enumerations could decide zero-temperature phases on higher-dimensional quasi-transitive graphs once suitable notions of deformable interfaces are available.
  • If the paper’s conjecture that the shrink property implies Type I for every density p is true, the entire phase diagram becomes purely geometric and independent of the initial measure.
  • The reduction of blinker detection to an auxiliary spatial automaton links the Ising classification problem to classical decidability questions for one-dimensional cellular automata.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper studies zero-temperature Glauber dynamics for the ferromagnetic Ising model on infinite one-dimensional quasi-transitive graphs G=(Z,E) with finite interaction range K. It proves that the I(G,1/2)-model is of Type I (every vertex flips infinitely often a.s.) if and only if G has the shrink property (no finite stable sets). Equivalence of the shrink property with right/left deformability of minimal icut-sets is established combinatorially (Lemma 1), and an algorithmic criterion via monotone interface advance is given (Proposition 1 and the greedy exploration). For graphs lacking the shrink property, the system is of Type F or Type M according to whether a finite set A_N of admissible confined configurations (bounded by fixed non-deformable walls) contains a zero-energy flip; this is decidable by exhaustive enumeration plus a pigeonhole cut-and-paste reduction (Theorem 2). The classification is independent of p in (0,1) and robust under fast quenching. Constructive examples of arbitrarily large blinkers and of rigid Type-F tilings are supplied.

Significance. The work gives a complete, constructive trichotomy (I/F/M) for a natural class of one-dimensional quasi-transitive graphs, going beyond the planar quasi-transitive results of [6] that only separated Type I from non-I. The algorithmic decidability of both the shrink property and the F-versus-M distinction, together with the explicit spatial bound N=4K(M+1)+C_W and the cut-and-paste reduction that preserves local fields, is a genuine contribution that turns an asymptotic classification into a finite combinatorial procedure. The constructive example of blinkers of arbitrary size and the robustness under fast quenching further strengthen the result. The restriction of the Type-I statement to p=1/2 is already flagged as a conjecture and does not diminish the theorems that are proved.

minor comments (4)
  1. In the proof of Theorem 1 the mapping of parameters to Lemma 9/Theorem 4 of [6] is asserted but not written out; a short explicit dictionary (or a self-contained one-paragraph argument) would make the one-dimensional adaptation fully transparent.
  2. Section 5.1 describes the decorated lattice supporting large blinkers and refers to Figure 1, yet the figure is only sketched in text; a properly typeset diagram would help the reader verify the field-cancellation construction.
  3. The constant C_W that appears in the definition of N is described as depending only on the chosen walls W_L, W_R; a one-line bound in terms of K and the wall diameters would make the complexity estimate completely explicit.
  4. A few minor typos appear (e.g., “icut-set” is sometimes written without the hyphen; “L´evy” accentuation is inconsistent). These are purely cosmetic.

Circularity Check

1 steps flagged · score 1.0 of 10

Minor self-citation for necessity half of Theorem 1; sufficiency, algorithms, and Type F/M classification are self-contained first-principles arguments with no reduction by construction.

  1. self citation load bearing [Proof of Theorem 1 (Section 3, first paragraph of proof)]
    "By Theorem 2 in [6], if the I(G,1/2)-model is of Type I, then G has the shrink property. Therefore, it remains to prove the converse implication."

    Necessity half of the central iff (Type I <=> shrink) is taken entirely from prior work by the same author without re-derivation in the 1D setting; while the paper supplies an independent sufficiency proof and new decidability results, the full statement of Theorem 1 rests partly on this self-citation as a black-box premise.

full rationale

The paper introduces shrink property, stable sets, deformability, admissible confined configurations, and the bound N from first principles (Defs. 1-7, Prop. 1, Thm. 2). Sufficiency (shrink => Type I) is proved in full via attractivity/FKG, Reverse Fatou, and Lévy Borel-Cantelli specialized to 1D quasi-transitive graphs (Section 3). Type F vs M is decided by exhaustive finite enumeration of A_N plus pigeonhole cut-and-paste that preserves local fields (Thm. 2 proof). The sole self-citation is the necessity direction of Thm. 1, imported as a black-box from the author's prior planar work [6]; this is not load-bearing for the new 1D algorithmic content or the constructive examples, and does not make any claim equivalent to its inputs by definition. No fitted parameters, no ansatz smuggling, no renaming of known results. Score 1 reflects only the mild, non-central self-citation.

Assumptions & free parameters 0 free parameters · 3 assumptions · 2 invented entities

The work is pure mathematical probability. It rests on the standard continuous-time Markov generator for zero-temperature Glauber dynamics, on attractivity and the FKG inequality for product measures, and on the classical Type I/F/M taxonomy. No numerical parameters are fitted; the only free geometric inputs are the translation period L and interaction range K of the given graph, which are part of the problem data rather than fitted constants. The shrink property and the set A_N are definitional tools, not postulated physical entities.

assumptions (3)
  • domain assumption The continuous-time Markov process with flip rates c(v,σ) equal to 0, 1/2 or 1 according to the sign of the local energy change ΔH_v is well-defined on the infinite product space and is attractive.
    Standard construction of zero-temperature Glauber dynamics used throughout Sections 2–4; taken as given from the literature.
  • standard math Attractivity of the dynamics together with the FKG inequality for the Bernoulli product measure P_{1/2} yields a uniform positive lower bound on the probability of monochromatic boundary configurations of width 2K.
    Invoked in the proof of Theorem 1 (Section 3) to obtain the recurrent favorable events E_t^K.
  • domain assumption If fixation occurs then, by translation invariance, at least one orbit under the period-L action has positive probability of never flipping (result taken from [6]).
    Used for the contradiction argument in the necessity half of Theorem 1.
invented entities (2)
  • shrink property
    purpose: Geometric condition equivalent to the absence of finite stable sets and to the deformability of every minimal icut-set; used as the exact criterion for Type I behavior.
    Defined in Definition 1; shown equivalent to several deformability statements in Lemma 1. Purely combinatorial, no independent physical evidence required.
  • admissible confined configuration (set A_N)
    purpose: Finite collection of spin patterns inside stable walls that cannot unlock energy-lowering flips; used as the decision set for Type M versus Type F.
    Defined in Section 4; the bound N is derived from the pigeonhole principle on local states of length 2K. Definitional tool for the algorithm.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Zero-temperature stochastic Ising model on one-dimensional quasi-transitive graphs." pith.science (2026). https://pith.science/paper/7NTSJTXW

@misc{pith2026260708330,
  author       = {Pith},
  title        = {Pith review of: Zero-temperature stochastic Ising model on one-dimensional quasi-transitive graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7NTSJTXW}},
  note         = {Machine review of arXiv:2607.08330}
}
abstract

We consider the zero-temperature stochastic Ising process describing $\pm 1$ spin-flip dynamics on an infinite one-dimensional quasi-transitive graph $G=(V,E)$ with finite interaction range $K$. We prove that the zero-temperature limit of the Glauber dynamics for this Ising model exhibits a Type $\mathcal{I}$ behavior (infinite fluctuations of all vertices) if and only if the graph possesses the so-called \emph{shrink property}. For graphs lacking this property, we introduce an algorithmic framework based on an auxiliary spatial automaton to distinguish, in finite time, between Type $\mathcal{F}$ behavior (almost sure local fixation) and Type $\mathcal{M}$ behavior (a mixed regime characterized by the presence of blinkers). We prove that the classification among these three regimes is algorithmically decidable. Furthermore, we provide a constructive example of a graph supporting blinkers of arbitrarily large size.

Figures

Figures reproduced from arXiv: 2607.08330 by the authors.

Figure 1
Figure 1. Spatially extended blinker configuration on the decorated graph. Crucially, although macroscopic configurations can embed zero-energy fluctuations of arbitrary size N, the enumerative algorithm does not need to construct or search through these extended systems. Because the graph structure permits local field cancellation on any single isolated cell, the finite set of confined configurations AN is guaranteed to cont… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages

  1. [6]

    and Newman, C

    Gandolfi, A. and Newman, C. M. and Stein, D. L. , TITLE =. Comm. Math. Phys. , FJOURNAL =. 2000 , NUMBER =. doi:10.1007/PL00005535 , URL =

    work page doi:10.1007/pl00005535 2000

  2. [1]

    and Bray, A

    Derrida, B. and Bray, A. J. and Godr\`eche, C. , TITLE =. J. Phys. A , FJOURNAL =. 1994 , NUMBER =

    work page 1994

  3. [2]

    Harris, T. E. , TITLE =. Ann. Probability , FJOURNAL =. 1977 , NUMBER =. doi:10.1214/aop/1176995804 , URL =

    work page doi:10.1214/aop/1176995804 1977

  4. [3]

    Harris, T. E. , TITLE =. Ann. Probability , FJOURNAL =. 1978 , NUMBER =. doi:10.1214/aop/1176995523 , URL =

    work page doi:10.1214/aop/1176995523 1978

  5. [4]

    Uniqueness and non-uniqueness in percolation theory , JOURNAL =

    H\". Uniqueness and non-uniqueness in percolation theory , JOURNAL =. 2006 , PAGES =. doi:10.1214/154957806000000096 , URL =

    work page doi:10.1214/154957806000000096 2006

  6. [5]

    , TITLE =

    Liggett, Thomas M. , TITLE =. 1985 , PAGES =. doi:10.1007/978-1-4613-8542-4 , URL =

    work page doi:10.1007/978-1-4613-8542-4 1985

  7. [7]

    and Newman, C

    Nanda, S. and Newman, C. M. and Stein, D. L. , TITLE =. On. 2000 , MRCLASS =. doi:10.1090/trans2/198/13 , URL =

    work page doi:10.1090/trans2/198/13 2000

  8. [8]

    and Keane, M

    Gandolfi, A. and Keane, M. and Russo, L. , TITLE =. Ann. Probab. , FJOURNAL =. 1988 , NUMBER =

    work page 1988

Show all 34 references
  1. [9]

    , TITLE =

    Tamuz, Omer and Tessler, Ran J. , TITLE =. Israel J. Math. , FJOURNAL =. 2015 , NUMBER =. doi:10.1007/s11856-014-1148-2 , URL =

    2015 doi

  2. [10]

    Fontes, L. R. and Schonmann, R. H. and Sidoravicius, V. , TITLE =. Comm. Math. Phys. , FJOURNAL =. 2002 , NUMBER =. doi:10.1007/s002200200658 , URL =

    2002 doi

  3. [11]

    Forien, Nicolas , TITLE =. Probab. Theory Related Fields , FJOURNAL =. 2021 , NUMBER =. doi:10.1007/s00440-021-01025-9 , URL =

    2021 doi

  4. [12]

    2017 , PAGES =

    Diestel, Reinhard , TITLE =. 2017 , PAGES =. doi:10.1007/978-3-662-53622-3 , URL =

    2017 doi

  5. [13]

    and Eckner, S

    Damron, M. and Eckner, S. M. and Kogan, H. and Newman, C. M. and Sidoravicius, V. , TITLE =. J. Stat. Phys. , FJOURNAL =. 2015 , NUMBER =. doi:10.1007/s10955-015-1247-4 , URL =

    2015 doi

  6. [14]

    Electron

    Amir, Gideon and Baldasso, Rangel , TITLE =. Electron. J. Probab. , FJOURNAL =. 2020 , PAGES =. doi:10.1214/20-ejp414 , URL =

    2020 doi

  7. [15]

    Cerqueti, Roy and De Santis, Emilio , TITLE =. Ann. Inst. Henri Poincar\'. 2018 , NUMBER =. doi:10.1214/17-AIHP820 , URL =

    2018 doi

  8. [16]

    , TITLE =

    Camia, Federico and De Santis, Emilio and Newman, Charles M. , TITLE =. Ann. Appl. Probab. , FJOURNAL =. 2002 , NUMBER =. doi:10.1214/aoap/1026915616 , URL =

    2002 doi

  9. [17]

    De Santis, Emilio and Maffei, Andrea , TITLE =. Probab. Theory Related Fields , FJOURNAL =. 2016 , NUMBER =. doi:10.1007/s00440-014-0608-2 , URL =

    2016 doi

  10. [18]

    Lectures on probability theory and statistics (

    Martinelli, Fabio , TITLE =. Lectures on probability theory and statistics (. 1999 , MRCLASS =. doi:10.1007/978-3-540-48115-7\_2 , URL =

    1999 doi

  11. [19]

    Damron, Michael and Kogan, Hana and Newman, C. M. and Sidoravicius, Vladas , TITLE =. Electron. J. Probab. , FJOURNAL =. 2013 , PAGES =. doi:10.1214/EJP.v18-3059 , URL =

    2013 doi

  12. [20]

    and Sidoravicius, Vladas , TITLE =

    Camia, Federico and Newman, Charles M. and Sidoravicius, Vladas , TITLE =. In and out of equilibrium (. 2002 , MRCLASS =

    2002

  13. [21]

    and Sidoravicius, Vladas , TITLE =

    Damron, Michael and Kogan, Hana and Newman, Charles M. and Sidoravicius, Vladas , TITLE =. Electron. Commun. Probab. , FJOURNAL =. 2016 , PAGES =. doi:10.1214/16-ECP4785 , URL =

    2016 doi

  14. [22]

    1991 , PAGES =

    Williams, David , TITLE =. 1991 , PAGES =. doi:10.1017/CBO9780511813658 , URL =

    1991 doi

  15. [23]

    Arratia, Richard , TITLE =. Ann. Probab. , FJOURNAL =. 1983 , NUMBER =

    1983

  16. [24]

    Chelkak, Dmitry and Cimasoni, David and Kassel, Adrien , TITLE =. Ann. Inst. Henri Poincar\'. 2017 , NUMBER =. doi:10.4171/AIHPD/42 , URL =

    2017 doi

  17. [25]

    Selected works of

    Benjamini, Itai and Schramm, Oded , TITLE =. Selected works of. 2011 , MRCLASS =. doi:10.1007/978-1-4419-9675-6\_21 , URL =

    2011 doi

  18. [26]

    Morris, Robert , TITLE =. Probab. Theory Related Fields , FJOURNAL =. 2011 , NUMBER =. doi:10.1007/s00440-009-0259-x , URL =

    2011 doi

  19. [27]

    Burton, R. M. and Keane, M. , TITLE =. Comm. Math. Phys. , FJOURNAL =. 1989 , NUMBER =

    1989

  20. [28]

    , TITLE =

    De Santis, Emilio and Newman, Charles M. , TITLE =. J. Statist. Phys. , FJOURNAL =. 2003 , NUMBER =. doi:10.1023/A:1021039200087 , URL =

    2003 doi

  21. [29]

    and Stein, Daniel L

    Gheissari, Reza and Newman, Charles M. and Stein, Daniel L. , TITLE =. J. Stat. Phys. , FJOURNAL =. 2018 , NUMBER =. doi:10.1007/s10955-018-2087-9 , URL =

    2018 doi

  22. [30]

    and Newman, Charles M

    Eckner, Sinziana M. and Newman, Charles M. , TITLE =. ALEA Lat. Am. J. Probab. Math. Stat. , FJOURNAL =. 2015 , NUMBER =

    2015

  23. [31]

    Caputo, Pietro and Martinelli, Fabio , TITLE =. Probab. Theory Related Fields , FJOURNAL =. 2006 , NUMBER =. doi:10.1007/s00440-005-0475-y , URL =

    2006 doi

  24. [32]

    Harris, T. E. , TITLE =. Ann. Probability , FJOURNAL =. 1974 , PAGES =. doi:10.1214/aop/1176996493 , URL =

    1974 doi

  25. [33]

    De Santis, Emilio and Lelli, Leonardo , TITLE =. J. Stat. Phys. , FJOURNAL =. 2023 , NUMBER =. doi:10.1007/s10955-023-03177-5 , URL =

    2023 doi

  26. [34]

    2017 , PAGES =

    Lanchier, Nicolas , TITLE =. 2017 , PAGES =. doi:10.1007/978-3-319-50038-6 , URL =

    2017 doi

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.