{"id":"f8fec439-c3e0-4c66-85f8-f392cbdb8297","arxiv_id":"2607.16707","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Strongly reinforced vertex-reinforced branching random walks have finite range almost surely and can localize on two sites; for generalized Pólya urns with bounded drawing sequences, one color fixes almost surely exactly when Σ 1/w(k) < ∞.","lead":"This paper studies branching random walks on the integers in which particles prefer to jump to sites already visited many times, alongside a generalized two-color Pólya urn with several draws per step. It proves that strong reinforcement makes the walk visit only finitely many sites almost surely (with positive chance of two-site capture), and extends Rubin's classical 1990 fixation criterion to bounded multi-draw urns.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.1's proof contains a false sufficiency claim: 'only red draws for K steps' does not imply the event A_n when σ_i=1; the gap is repairable, but the written proof is incomplete.","rationale":"The reader correctly identifies a real gap in the written proof of Theorem 1.1: inequality (7) is false as stated. I agree this is the most load-bearing concern for the central claim. However, I do not share the reader's first concern about the Rubin embedding: Lemma 4.1 is a standard competing-clocks construction, and the leftover-time bookkeeping is consistent because in a batch the unchosen color's count does not change, so its rate does not change between steps. The embedding is not the weak point. The Eq. (7) error is localized and repairable by enlarging the block length from K to 2K (or K^2) and adjusting the constant from 1/(2K^2) to a positive K-dependent constant. The theorem is therefore not falsified, but the manuscript as submitted does not contain a correct proof of the uniform conditional probability bound without this repair. The existing CONDITIONAL verdict is appropriate; no change in verdict is needed.","tokens_in":19327,"tokens_out":39428,"duration_ms":364134,"concrete_test":"Set σ_n = 1 for all n and fix K ≥ 1, with R_n = τ_n/2. Directly compute the event that the next K draws are all red: its probability is at most (1/2)^K, and even conditional on that event, A_n fails because R_{n+K} = τ_n/2 + K < τ_{n+K}/2 + K = τ_n/2 + 3K/2. Then repeat the computation with 2K all-red steps, verify that R_{n+2K} ≥ τ_{n+2K}/2 + K, and recompute the resulting lower bound (approximately (1/2)^{2K^2}) to confirm that the intended argument survives with modified constants. This distinguishes a harmless index typo from a structural flaw.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central proof of Theorem 1.1 relies on the estimate (7): on {R_n ≥ τ_n/2}, the event A_n = {R_{n+K} ≥ τ_{n+K}/2 + K} is claimed to hold with probability at least 1/(2K^2), because it suffices that only red balls are drawn during the next K steps. This is false for the worst case σ_i = 1 for i=1,...,K. If only red balls are drawn for K steps, then τ_{n+K} = τ_n + K and, even starting from the best case R_n = τ_n/2, we get R_{n+K} = τ_n/2 + K, while A_n requires R_{n+K} ≥ (τ_n+K)/2 + K = τ_n/2 + 3K/2. The shortfall is K/2, so the all-red event does not imply A_n. The probability lower bound in (7) therefore does not follow. The gap is repairable: using 2K steps instead of K (or replacing K by K^2) makes the all-red event sufficient, since σ_i ≥ 1, and gives a positive constant of the form (1/2)^{O(K^2)} instead of 1/(2K^2). But as written, the proof of Theorem 1.1 has a concrete missing argument at exactly the point where it derives a uniform positive conditional probability of fixation. The Rubin embedding itself (Lemma 4.1) appears sound; the fragile step is this discrete probability estimate, not the continuous-time construction.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies two reinforced random processes. The main object is a vertex-reinforced branching random walk on Z: along a Kesten tree, each particle jumps to a neighboring site with probability proportional to a nondecreasing weight w of the local time of the target site. The second is a generalized two-color Pólya urn in which step n adds σ_n new balls whose colors are drawn independently with probability proportional to w of the current color count. The central result, Theorem 1.1, asserts that for bounded batch sizes σ_n, Rubin's criterion continues to hold: summability of 1/w(k) is equivalent to positive probability of fixation of one color and equivalent to almost-sure fixation of at least one color. The paper also proves VRBRW localization results (Propositions 1.1 and 1.2), almost-sure fixation under stretched-exponential type hypotheses (Theorems 1.2, 4.1, 4.2), and applications to a VRBRW restricted to three sites. The main tool is a continuous-time embedding of the urn process generalizing Rubin's algorithm, with careful leftover-clock bookkeeping.","tokens_in":19684,"tokens_out":16001,"duration_ms":149614,"significance":"The continuous-time embedding in Lemma 4.1 is a genuine and useful construction; it is defined in detail and, as far as I can check, sound. The paper is explicit about its hypotheses and limitations; Hypotheses 4.1 and 4.2 are concrete, and Remark 4.3 honestly indicates where the proof stops. If the proof of Theorem 1.1 is repaired, the result is a natural and substantial extension of Rubin's classical fixation criterion to bounded variable batch sizes, and the VRBRW consequences in Propositions 1.1 and 1.2 are nontrivial. I found no circularity, hidden fitting, or invented parameters. My substantive reservation is a single load-bearing false estimate in Eq. (7) of the proof of Theorem 1.1; it appears locally patchable, but as submitted the central proof is incomplete.","major_comments":[{"comment":"The estimate P(A_n | F_{T_n}) 1_{R_n ≥ τ_n/2} ≥ 1/(2K^2) is false as written. The justification given is that A_n holds if only red balls are picked during the next K steps. In the extreme case σ_{n+1}=...=σ_{n+K}=1, starting from R_n = τ_n/2, the all-red event gives R_{n+K} = τ_n/2 + K and τ_{n+K} = τ_n + K, so R_{n+K} = τ_{n+K}/2 + K/2, which falls K/2 short of the requirement in A_n. Thus the uniform lower bound, which is load-bearing for the proof of Theorem 1.1, does not follow. The gap is local and repairable: using 2K steps instead of K, the all-red event yields S = Σ_{i=1}^{2K} σ_{n+i} ≥ 2K, hence R_{n+2K} ≥ τ_{n+2K}/2 + K whenever R_n ≥ τ_n/2; since each of at most 2K^2 draws has red probability at least 1/2, the lower bound becomes 2^{-2K^2} (or a similar constant). The proof should be rewritten with this corrected event and indices, and the subsequent inclusion (8) should be a","section":"§4.2, proof of Theorem 1.1, Eq. (7)"}],"minor_comments":[{"comment":"The definition of τ_n contains σ_0, but the drawing sequence starts at σ_1; it should read τ_n = R_0 + B_0 + σ_1 + ... + σ_n.","section":"§1.2"},{"comment":"After repairing Eq. (7), the event A_n and the indices in Eq. (8) should be updated consistently (replace n+K by n+2K) so that the displayed sums match the new proof.","section":"§4.2"},{"comment":"The passage from the one-step lower bound for the probability that x+1 remains unvisited to the almost-sure conclusion sup R' < ∞ is very compressed. A short conditional-Borel-Cantelli or product argument over successive first visits would make the proof easier to verify.","section":"§5"},{"comment":"The filtration F_t is defined for continuous t; the use of F_{T_n} should be explicitly understood as the stopped σ-field. This is standard but should be stated.","section":"§4.2, Lemma 4.2"}],"recommendation":"major_revision","confidential_remarks":"To the editor: I found no evidence of circularity, overfitting, or unsupported claims beyond the specific gap in Eq. (7). The gap is localized and the 2K-step repair sketched in my report should make the proof of Theorem 1.1 work. I recommend major revision rather than rejection: the central claim is defensible, but the written proof is incomplete at a named equation. If the author supplies a corrected version of Section 4.2 with the estimate repaired and the subsequent arguments updated, I would expect the paper to become acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this one if you work on reinforced processes or multi-draw urns. The new VRBRW model is a natural branching analogue of VRRW, and the continuous-time embedding for GPU urns with arbitrary σ_n is a genuine tool that should be useful beyond this paper. Theorem 1.1 (Rubin's criterion for bounded σ_n) is a real extension, not a corollary, and Propositions 1.1/1.2 plus the three-site application give the first localization results for the branching model. The citation pattern is fine; the self-citations are to published background in the same program.\n\nThe soft spot is exactly where the reader flagged it. In the proof of Theorem 1.1, inequality (7) claims that on {R_n ≥ τ_n/2}, the event A_n = {R_{n+K} ≥ τ_{n+K}/2 + K} has probability at least 1/(2K^2) because it suffices that only red balls are drawn for K steps. That sufficiency is false when σ_i = 1: all-red gives R_{n+K} = τ_n/2 + K, while A_n requires τ_n/2 + 3K/2. So the stated lower bound is not established. The fix is straightforward—use 2K steps and accept a 2^{-2K^2} constant—but as written the central proof has a concrete gap. This is not a fatal flaw in the strategy; the embedding (Lemma 4.1) looks sound and the martingale closing argument works once (7) is repaired.\n\nSecond, Theorem 1.2 and the verification of Hypotheses 4.1/4.2 in the examples are sketched rather than fully detailed. In particular the proof of Theorem 1.2 says the conditions are satisfied, then goes through a separate argument for (17); a referee should ask for the routine but not entirely trivial details. Proposition 1.1's finite-range proof is also brief, though plausible.\n\nOverall: the paper is a serious contribution with a patchable gap. I'd want the author to fix (7) and expand the Theorem 1.2 verification before acceptance, but I'd absolutely send it to a knowledgeable referee rather than desk-reject.","headline":"A serious contribution on multi-draw Pólya urns and a new vertex-reinforced branching random walk, but the proof of Theorem 1.1 contains a concrete gap at equation (7) that looks patchable.","tokens_in":20188,"tokens_out":2403,"would_cite":true,"duration_ms":22241,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J80","60K35","60G42"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that the classical fixation criterion for two-color Pólya urns survives when several balls are drawn per step, provided the batch sizes are bounded, and transfers it to vertex-reinforced branching random walks to give two-s","keywords":["vertex reinforced branching random walk","generalized Pólya urn","multiple draws","fixation","localization","continuous-time embedding","critical Galton-Watson tree","martingale"],"falsifier":"Simulate the two-color urn with bounded batch size, e.g., σ_n = 2 for all n, and weight w(k) = k^2, so Σ 1/w(k) < ∞. The theorem predicts P(both colors are drawn infinitely often) = 0; a statistically robust positive estimate from many independent runs would falsify it. As a secondary check, monitor the continuous-time embedding: the theorem says the total time T_∞ is finite and one color's clock is exhausted almost surely, so repeated observation of both clocks surviving forever would contradict the claim.","tokens_in":19175,"feed_emoji":"🎲","tokens_out":6824,"duration_ms":66865,"temperature":0.7,"pith_summary":"This paper establishes a sharp dichotomy for generalized time-dependent Pólya urns: if the weight function satisfies Σ 1/w(k) < ∞ and the number of draws per step is bounded, then one color is drawn only finitely often with probability one; if the series diverges, both colors are drawn infinitely often with probability one. This extends the classical one-draw-per-step criterion to arbitrary bounded batch sizes. The same convergent-series condition controls vertex-reinforced branching random walks on the integers: it forces the walk to visit only finitely many sites almost surely, with positive probability of being trapped forever on two neighboring sites, while divergence rules out traps on two or three sites. A continuous-time embedding of the urn process is the central tool, and a bounded-increment martingale transfers the conclusions from the urn to the branching walk.","feed_headline":"One convergent sum rules when a reinforced urn fixates","feed_subtitle":"Bounded batch sizes keep the classical criterion; on a branching walk, traps on two sites then occur with positive probability.","key_machinery":"The central mechanism is a continuous-time Rubin-style embedding: each ball carries an independent exponential clock with rate equal to the weight of its color's current count, and the discrete urn is reproduced by running the clocks until σ_n arrivals have occurred, carrying any leftover clock time into the next step. This construction is the hinge of the proof, converting drawing probabilities into clock-comparison inequalities and reducing fixation to whether the total time T_∞ is finite. A secondary tool is the bounded-increment martingale M_n(x) = Y^+_n(x) − Y^-_n(x), the difference between weighted crossing counts at a site, whose oscillation forces infinite local time at one site to s","core_discovery":"The main theorem is a 0–1 law: for a two-color urn in which step n adds σ_n balls chosen with probability proportional to w(number of balls of that color), if the sequence σ_n is bounded then Σ 1/w(k) < ∞ is equivalent to P(one color is eventually drawn only finitely often) > 0, and also equivalent to the conclusion that this fixation happens with probability one. The converse gives coexistence of both colors with probability one when the series diverges. The proof works by embedding the discrete urn into continuous time, giving each ball an exponential clock whose rate is the weight of its color count and carrying leftover time across batches; finiteness of the total running time—which is e","pith_inferences":["If the paper's Remark 4.3 conjecture holds—that Σ σ_{n+1}/w(τ_n/2) < ∞ alone, without boundedness, implies almost sure fixation—then the bounded-batch theorem becomes a special case of a single clock-finiteness principle, unifying the two main regimes.","The proof's coupling arguments point to a stronger conclusion in fast-growth regimes: the ratio of the dominant color converges to infinity, a 'strong fixation' property that may hold under substantially weaker hypotheses than the stretched-exponential conditions stated.","A testable extension is to relax boundedness of σ_n to a mild growth condition such as σ_n = o(w(τ_n)) and simulate the urn; the continuous-time embedding makes such experiments direct, and the results could guide a proof of a general criterion.","For the branching walk on Z, only positiveness of the two-site trapping probability is proved; estimating or bounding P(|R'|=2) for concrete weights like w(k)=k^α would quantify the likelihood of localization and is a natural next step."],"forward_implications":["For any bounded batch sequence σ_n, the two-color urn exhibits an exact fixation-or-coexistence dichotomy: Σ 1/w(k) < ∞ ⇒ almost sure fixation of one color, while Σ 1/w(k) = ∞ ⇒ both colors are drawn infinitely often almost surely.","For vertex-reinforced branching random walks on Z, a reciprocally summable weight gives finite visited range almost surely and a strictly positive probability of eternal trapping on two neighboring sites.","If Σ 1/w(k) = ∞, the branching walk cannot end up trapped on exactly two or three sites; it must visit at least four sites infinitely often.","A general sufficient localization condition emerges from the embedding: Σ σ_{n+1}/w(⌈τ_n/2⌉) < ∞ implies T_∞ < ∞ a.s. and hence fixation, a condition the paper suggests may be the true boundary even without boundedness.","For stretched-exponential weights with polynomially growing batches (w(n)=exp(c n^α), σ_n=n^β, β>(1−α)/α), fixation occurs almost surely; for exponential weights, the three-site restricted branching walk localizes almost surely on two sites."],"fun_headline_variants":["Bounded batch sizes: urn fixation occurs iff series converges","0-1 law for two-color urn with time-dependent draws","Variable urn draws: bounded steps fixate if sum 1/w(k) finite","Continuous-time clock yields urn fixation criterion","Urn fixation probability: series convergence decides"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The entire characterization rests on the validity of the continuous-time embedding that claims the discrete urn with arbitrary batch sizes has exactly the same law as independent exponential clocks with leftover time carried across batches; if that bookkeeping is inexact, the dichotomy between fixation and coexistence is no longer forced.","fun_headline_variants_meta":{"raw":{"variants":["Bounded batch sizes: urn fixation occurs iff series converges","0-1 law for two-color urn with time-dependent draws","Variable urn draws: bounded steps fixate if sum 1/w(k) finite","Continuous-time clock yields urn fixation criterion","Urn fixation probability: series convergence decides"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000805,"raw_usage":{"total_tokens":3331,"prompt_tokens":660,"completion_tokens":2671,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":404,"completion_tokens_details":{"reasoning_tokens":2591}},"tokens_in":404,"tokens_out":2671,"duration_ms":19369,"temperature":1.0,"reasoning_tokens":2591,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T20:11:49.291250+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the two-color urn with bounded batch size, e.g., σ_n = 2 for all n, and weight w(k) = k^2, so Σ 1/w(k) < ∞. The theorem predicts P(both colors are drawn infinitely often) = 0; a statistically robust positive estimate from many independent runs would falsify it. As a secondary check, monitor the continuous-time embedding: the theorem says the total time T_∞ is finite and one color's clock is exhausted almost surely, so repeated observation of both clocks surviving forever would contradict the claim.","supporting_citations":[],"review_version":1}