{"id":"33df3957-c07e-4195-9455-0dafcd3ac75b","arxiv_id":"1908.09450","paper_version":4,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"The extremal stationary distributions of the voter model on Z^d, d at least 3, are isomorphic to Bernoulli shifts via explicit factor-of-IID constructions.","lead":"The paper proves that the stationary states of the voter model on the d-dimensional integer lattice, for d at least 3, are Bernoulli shifts, a question left open by Steif and Tykesson. A generalist might read it because the proof builds these infinitely correlated states explicitly from independent random inputs, a sharp form of ergodicity.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 3.3's negative-correlation estimate is the load-bearing step; Appendix A's coupling proof is terse and unverified, so a hidden gap would break the Borel-Cantelli argument.","rationale":"The reader's weakest_assumption identifies Lemma 3.3, and I agree that this is the load-bearing point in the proof of Proposition 3.1. The overall strategy is sound: Lemma 2.7 shows each stage preserves the required conditional marginals, Proposition 2.9 quantifies the flip probability through explicit coalescence events, and Proposition 3.1 turns the resulting estimate into an almost-sure convergence statement via Borel-Cantelli. The final deduction from a factor of IID to a Bernoulli shift uses standard Ornstein-Weiss theory, and the entropy bound log 2 is routine. The only place where the argument depends on a nonstandard, non-textbook inequality is Lemma 3.3. I examined the Appendix A proof carefully: the coupling with a ghost path is a standard graphical construction, the subset inclusion is credible, and the factor 2 in (3.3) follows from summing over the two possible orders of i2 and i3. I did not find a concrete error. The concern is therefore a verification risk rather than a demonstrated flaw: the proof is short and compressed, and the inequality is load-bearing. Because the paper's own argument appears to fill the gap, I do not think the verdict should change. I would only escalate if the formalization or the proposed numerical cross-check reveals a violation. Thus ACCEPT/UNCHANGED is appropriate, with confidence left moderate due to the unverified lemma.","tokens_in":21733,"tokens_out":34196,"duration_ms":356682,"concrete_test":"Fully formalize the Appendix A coupling: construct unconstrained coalescing walks from independent Poisson clocks, add the ghost path tilde P_{0,k}, and prove by induction over jump times that every constrained path J[{W_j+x_j}, {tilde P_{0,k}}] is pointwise either the ghost path or one of the unconstrained coalescing paths. Then re-derive (3.3) from (A.1) and verify the factor 2 is obtained by summing over j2 and using symmetry. As a computational cross-check, sample the left- and right-hand sides of (3.3) on a large d=3 torus with L=64 at k=7; a violation beyond Monte Carlo error would indicate the lemma is false, while agreement would support the proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 1.2) relies on Proposition 3.1: sum_k P[D_k(0) != D_{k+1}(0)] < infinity. The proof controls this sum via Proposition 2.9, which bounds the flip probability by expected indicators of two- and three-walker coincidence events. To make the resulting sums over x1,x2,x' decay exponentially in k, the proof invokes Lemma 3.3(3.2)-(3.3), asserting negative correlation for the set S_k of occupied coalescing-walker sites: P[a1 = tilde P_{0,k}(t), a2,a3 in S_k] <= 2 P[a1 = tilde P_{0,k}(t)] P[0 in S_k]^2. If (3.3) failed, the doubly summed term in (3.4) would not be summable by the stated estimates, and the staged coupling might only converge along sparse subsequences or not at all. The proof of (3.3) in Appendix A is a coupling of the infinite coalescing system with an absorbing ghost path, asserting a pointwise inclusion of path sets for all times. This is plausible from the graphical construction, but the appendix compresses the key step ('we could couple ... such that') and the summation over j2 that produces the factor 2. The lemma is not a standard textbook result and has no machine-checked verification. I found no explicit error and the argument appears internally coherent, but this is the least secure load-bearing point in the paper.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper proves that for the voter model on Z^d with d≥3, every extremal stationary distribution μ_p (0≤p≤1) is isomorphic to a Bernoulli shift. The proof constructs μ_p explicitly as a factor of an IID process on Z^d: the authors build a sequential coupling of the measures M_{2^k}ρ_p by a biased coupling of coalescing random walks, recoloring a small set of remaining walkers at each stage so that each site's color changes only finitely many times almost surely. The flip probabilities are controlled by two- and three-walker intersection estimates (Proposition 2.9 and Appendix B) and by a negative-correlation estimate for occupied sites of coalescing walks (Lemma 3.3 and Appendix A). The resulting limit is a translation-invariant factor of IID with finite entropy, so Ornstein's isomorphism theorem gives the Bernoulli property, answering a question of Steif and Tykesson.","tokens_in":21993,"tokens_out":45708,"duration_ms":473896,"significance":"This is a significant result: it resolves an open question of Steif and Tykesson and provides the first natural divide-and-color example with infinite equivalence classes whose coloring process is nonetheless Bernoulli. The construction is explicit, translation-invariant, and quantitative, with detailed estimates in the body and appendices. If the technical point in Proposition 3.1 is clarified, the paper is a strong contribution to the theory of factors of IID for interacting particle systems and to the ergodic theory of infinite-range random fields.","major_comments":[{"comment":"The final displayed summability bound does not follow from the preceding estimates as written. After plugging (3.5) and (3.6) into (3.4), the two summands inside the square root are of order 2^{-k(λ-1/2)} and 2^{-k(2λ-3/2)}. The paper then bounds the whole expression by a constant (displayed with λ and λ^2) times 2^{-k/4}. This is justified only if λ>3/4 (and for the second term, as printed, λ>7/8). Lemma 3.2, however, only asserts the existence of some λ>0 with P[0∈S_k]<2^{-kλ}, and gives no quantitative lower bound. If the Bramson-Griffeath estimate only supplies λ≤3/4, the Borel-Cantelli argument in Proposition 3.1 would not go through. Please state explicitly the quantitative exponent available from [BG80] (for example, that λ can be taken strictly larger than 3/4) and correct the final estimates accordingly.","section":"Section 3, proof of Proposition 3.1"},{"comment":"The key coupling assertion in this appendix is compressed: the statement that one can couple {W_i} and {W'_i} so that the path sets satisfy the displayed pointwise inclusion is not proved, and this inclusion underpins both (3.2) and (3.3). Since Lemma 3.3 is a load-bearing nonstandard estimate, the graphical-construction argument should be written out in detail. In addition, the sentence 'using symmetry between a2 and a3' is not immediately justified, because the enumeration {x_i} is fixed and the coalescing-walk law is not invariant under swapping two arbitrary target sites while fixing 0 and a1. The desired bound still follows by applying the two-order inequality (A.1) separately to the orders i2<i3 and i3<i2 and then using (3.2), so the statement of (3.3) is not at risk, but the text should be corrected.","section":"Appendix A, proof of Lemma 3.3"}],"minor_comments":[{"comment":"The strict inequality P[0∈S_k]<2^{-kλ} fails at k=0, because S_0=Z^d and P[0∈S_0]=1. Since Proposition 3.1 only needs a bound up to a constant factor, please restate the lemma for k≥1 or with a leading constant.","section":"Lemma 3.2"},{"comment":"The text says the expected number of locations visited by the rate-2 walk is bounded by 2t; more precisely it is at most 1+2t (the starting site plus one per jump). The subsequent constant 2t^{-1} should be adjusted to 3t^{-1} for t≥1 (or an equivalent statement), which does not affect the finiteness of the final sums.","section":"Proposition 2.9, bound after (2.5)"},{"comment":"Several displayed quantities such as '21−k', '23/2', and '2−kλ' are missing superscript formatting, making the algebra harder to read than it should be. Please ensure all exponents are typeset correctly.","section":"Notation throughout"}],"recommendation":"major_revision","confidential_remarks":"The paper is strong and the construction is genuinely original. The main issue is the unstated quantitative lower bound on λ in Proposition 3.1; I expect this is a straightforward fix by citing the correct Bramson-Griffeath exponent, but as written the summability step is not valid. The Appendix A coupling is also terse and should be expanded. After these revisions I would expect the paper to be acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bottom line: this paper proves a real theorem. It answers Steif and Tykesson's question by showing that the extremal stationary distributions of the voter model on Z^d, d>=3, are factors of IID, and therefore Bernoulli shifts via Ornstein. The proof is a new construction: a dyadic-time coupling using biased coalescence, so each walker's color changes only finitely often.\n\nThe paper does the right kind of work: explicit factor, not an abstract existence argument. The two-time coupling is careful—random grouping by the v's, biased selection of the walk, recolor step to restore IID coloring. The flip-probability bound (Prop 2.9) is written in full, and Appendix B's coalescence estimates are standard. Bramson-Griffeath is cited for the exponential decay of occupancy, which is appropriate. No fitted parameters anywhere.\n\nThe soft spot is Lemma 3.3, the negative-correlation estimate. The appendix proof is terse, compressing the coupling into one sentence. I read it against the stress-test concern: the coupling is valid, since adding an absorbing path only shrinks the occupied set of the unconditioned coalescing system, and the factor 2 comes from summing over the two orders in which the target sites are first hit. The concern that this is load-bearing is fair; the load holds. I would still ask a referee to check Appendix A line by line, since a wrong inequality there would break the Borel-Cantelli argument.\n\nTwo minor notes. The paper is notation-heavy; the Ft formalism is abstract but necessary. And it gives a factor of IID, not a finitary coding; that is not a flaw for the question asked, but readers should not expect finitariness.\n\nThis is for people in spatial ergodic theory, interacting particle systems, and factor-of-IID theory. It deserves a serious referee; send it out. I would bet on correctness.","headline":"The voter model stationary measures in d>=3 are Bernoulli shifts; the explicit coupling is new and the proof holds up under scrutiny.","tokens_in":22575,"tokens_out":11602,"would_cite":true,"duration_ms":123365,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K35","37A35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that on $\\mathbb{Z}^d$ with $d\\ge 3$, every extremal stationary distribution $\\mu_p$ of the voter model is a Bernoulli shift, constructed explicitly as a factor of IID.","keywords":["voter model","stationary distributions","Bernoulli shifts","factor of IID","coalescing random walks","generalized divide and color","random equivalence relations","translation-invariant processes"],"falsifier":"Compute, for coalescing simple random walks on $\\mathbb{Z}^d$ run until time $2^k-1$, the three-point probability $\\mathbb{P}[a_1=\\tilde P_{0,k}(2^k-1),\\, a_2,a_3\\in S_k]$ for three distinct sites and compare it with $2\\,\\mathbb{P}[a_1=\\tilde P_{0,k}(2^k-1)]\\,\\mathbb{P}[0\\in S_k]^2$; a violation at any $k$ would refute the paper's negative-correlation lemma and break the flip-probability bound.","tokens_in":21470,"feed_emoji":"🗳️","tokens_out":8705,"duration_ms":80670,"temperature":0.7,"pith_summary":"The paper proves that on $\\mathbb{Z}^d$, $d\\ge 3$, the voter model's extremal stationary distributions $\\mu_p$, for $0\\le p\\le 1$, are isomorphic to Bernoulli shifts — the translation-invariant processes built from i.i.d. labels, up to isomorphism. This answers a question from the generalized divide-and-color literature about whether a random partition with infinite clusters can still give rise to a Bernoulli coloring. The proof works by constructing each $\\mu_p$ explicitly as a factor of an IID process on $\\mathbb{Z}^d$: a translation-invariant measurable function of independent random variables. Since $\\mu_p$ has finite entropy, the classical entropy-isomorphism theorem upgrades factor-of-IID to full Bernoullicity. The construction couples the measures $M_{2^k}\\rho_p$ at dyadic times using coalescing random walks so that every site's opinion changes only finitely often and the almost-sure limit is $\\mu_p$.","feed_headline":"Voter model equilibria in d≥3 are Bernoulli shifts","feed_subtitle":"An explicit coupling at dyadic times makes each site flip opinions only finitely often.","key_machinery":"The central object is an explicit two-time coupling map $F_t$ built from coalescing simple random walks, the dual process of the voter model. Given a sparse set of walkers with an IID Bernoulli coloring, the map selects each walker's path from a biased mixture of two measures, $W_0$ and $W_1$, whose average is the true law of a simple random walk; this preserves the marginal distribution exactly while making walkers of the same color preferentially coalesce. The construction uses only IID inputs: independent random-walk proposals, uniform random variables, and Bernoulli coloring, grouped into finite sparse sets to define a translation-invariant ordering. The paper concatenates these maps at times $2^k-1$, and controls the total number of color changes via negative-correlation estimates for coalescing walks and coalescence-time estimates for independent walks, proving that the coupled opinions converge almost surely.","core_discovery":"On its own terms, the paper establishes that for every $0\\le p\\le 1$ and every $d\\ge 3$, the extremal stationary distribution $\\mu_p$ of the voter model is isomorphic to a Bernoulli shift. The route is to construct $\\mu_p$ as a factor of an IID process on $\\mathbb{Z}^d$: a measurable, translation-equivariant function of independent random variables attached to the lattice sites. Because the measure has finite entropy, the classical entropy-isomorphism theorem for amenable group actions turns this factor-of-IID statement into an isomorphism with a finite-state Bernoulli shift. The construction is explicit: a recursively defined coupling of the measures $M_{2^k}\\rho_p$ converges almost surely in the product topology, and the limiting configuration has law $\\mu_p$ and is a factor of IID.","pith_inferences":["The explicit coupling suggests that quantitative rates of convergence to $\\mu_p$ should be extractable from the flip-probability bounds, although the paper does not state such rates.","Because the proof uses only transience plus negative correlation of the coalescing walkers, a similar staged-coupling scheme may apply to other partition-color models on $\\mathbb{Z}^d$ whose dual partitions satisfy the same two-point and three-point negative-correlation estimates.","The dyadic schedule $2^k$ is a natural but not obviously necessary choice; a proof with any geometrically growing sequence of times would likely go through, though the constants in the flip bound would need to be recomputed."],"forward_implications":["For each $p\\in[0,1]$ and $d\\ge 3$, the stationary distribution $\\mu_p$ is a factor of an IID process on $\\mathbb{Z}^d$, with an explicit translation-invariant construction.","Every extremal stationary distribution of the voter model in $d\\ge 3$ is isomorphic to a finite-state Bernoulli shift.","The dyadic-time coupling gives an almost-sure limit: for each fixed site, the opinion process changes only finitely often as the coupling time grows.","The result covers the entire family $\\{\\mu_p\\}_{p\\in[0,1]}$ uniformly, including the trivial extremal measures at $p=0$ and $p=1$."],"supporting_citations":[{"why":"Poses the question about whether infinite-cluster divide-and-color models can produce Bernoulli colorings, which the voter model answers.","marker":"[ST17]"},{"why":"Supplies the theorem that factors of Bernoulli shifts are Bernoulli shifts, used to upgrade factor-of-IID to Bernoullicity.","marker":"[Orn70b]"},{"why":"Supplies the entropy-isomorphism theorem, showing equal-entropy Bernoulli shifts are isomorphic.","marker":"[Orn70a]"},{"why":"Extends the relevant isomorphism theorems to actions of amenable groups such as $\\mathbb{Z}^d$.","marker":"[OW87]"},{"why":"Provides the exponential bound $\\mathbb{P}[0\\in S_k]\\le 2^{-k\\lambda}$ used to control opinion-flip probabilities.","marker":"[BG80]"},{"why":"Gives the standard description of extremal stationary distributions of the voter model as limits of $M_t\\rho_p$.","marker":"[Lig04]"},{"why":"Supplies the dual representation of the voter model through coalescing simple random walks used throughout the construction.","marker":"[AF02]"}],"fun_headline_variants":["Voter model in d≥3: stationary states are Bernoulli shifts","Explicit IID factors for voter model equilibria in d≥3","Voter model in d≥3: stationarity from explicit IID coupling","Voter model stationary laws: explicit Bernoulli isomorphisms in d≥3"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole argument leans on the estimate that coalescing random walkers repel one another: if two or three walkers occupy specified locations, the chance is no larger than a small constant times what independent walkers would give, and without that repulsion the coupled opinions might never settle down.","fun_headline_variants_meta":{"raw":{"variants":["Voter model in d≥3: stationary states are Bernoulli shifts","Explicit IID factors for voter model equilibria in d≥3","Voter model in d≥3: stationarity from explicit IID coupling","Voter model stationary laws: explicit Bernoulli isomorphisms in d≥3"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000622,"raw_usage":{"total_tokens":2789,"prompt_tokens":757,"completion_tokens":2032,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":373,"completion_tokens_details":{"reasoning_tokens":1952}},"tokens_in":373,"tokens_out":2032,"duration_ms":14399,"temperature":1.0,"reasoning_tokens":1952,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:10:49.947444+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for coalescing simple random walks on $\\mathbb{Z}^d$ run until time $2^k-1$, the three-point probability $\\mathbb{P}[a_1=\\tilde P_{0,k}(2^k-1),\\, a_2,a_3\\in S_k]$ for three distinct sites and compare it with $2\\,\\mathbb{P}[a_1=\\tilde P_{0,k}(2^k-1)]\\,\\mathbb{P}[0\\in S_k]^2$; a violation at any $k$ would refute the paper's negative-correlation lemma and break the flip-probability bound.","supporting_citations":[],"review_version":1}