{"id":"2b868c0f-a01f-4d1b-8085-03a61edc38fd","arxiv_id":"2601.02992","paper_version":3,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"Claims all-scale polynomial couplings between Brownian and random-walk loop soups in all dimensions, but the stated loop-selection thresholds are mismatched for d≠2 (and for continuous time even d=2), breaking the theorem.","lead":"This paper claims a coupling between Brownian loop soups and random walk loop soups on Z^d that works for loops at every polynomial scale, removing a restriction that had been considered sharp. The construction is elegant, but as stated the comparison sets in the main theorems are mismatched for most dimensions, so the claimed one-to-one correspondence does not hold.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.2/1.3 select different block indices on the two sides; the block-by-block coupling cannot produce the claimed bijection except in the discrete-time d=2 case.","rationale":"I read the paper in good faith: the main contribution is a clever block-indexed coupling that would indeed give all polynomial scales if the theorem statement matched the construction. However, the central claim selects loops by different functionals on the two sides: Brownian loops by the block index through chi_N, random-walk loops by actual rescaled time. Since the coupling pairs block n to block n exactly, the two selection conditions must select the same set of n-blocks. Lemma 3.1 shows they do not: the Brownian condition selects n>N^theta, while the random-walk condition selects n>(d/2)N^theta for continuous time (and similarly for discrete time except d=2). The mismatch is not a minor boundary effect: for d≠2 it is a macroscopic interval of length ~N^theta, and the expected number of loops in that interval grows like N^{d(1-theta/2)}. This makes the claimed high-probability one-to-one correspondence impossible. Continuous-time d=2 also fails due to a one-block boundary mismatch with expected count N^{2-2theta}, which cannot be dominated by cN^{-a} for arbitrary a. The proof's event A in Section 3.3 only controls blocks N^theta<n<N^k and (3.7) controls n>=N^k; the discrepancy interval is not covered. This is an internal inconsistency in the main theorem, not merely a disagreement with prior results. The reader's REJECT verdict is therefore appropriate, and I recommend no change.","tokens_in":12455,"tokens_out":9892,"duration_ms":92445,"concrete_test":"For Theorem 1.2 with d=3 and theta=1, compute the expected number of Brownian loops selected by chi_N(t_gamma)>N^{-1} with block index N<n<3N/2, using (3.5), (3.3), and (1.11). Independently compute the expected number of selected random-walk loops in the same block range. If the Brownian expectation is positive while the random-walk expectation is zero, the claimed bijection fails. Equivalently, re-derive the set of block indices n selected by each side of the theorem and verify equality; the asymptotics a_n=2n/d show they differ for d≠2.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In the construction, a random-walk loop in block n has rescaled time ~2n/(dN^2), while the paired Brownian loop has rescaled time in [a_n,a_{n+1})/N^2 with a_n ~ 2n/d (Lemma 3.1). Thus the coupling pairs exactly the same n-blocks. The Brownian selection condition chi_N(t_gamma)>N^{theta-2} means n>N^theta, since chi_N(t)=k/N^2 for t in block k and k>N^theta. The random-walk selection condition t_{tilde gamma}>N^{theta-2} means, up to O(1), n>(d/2)N^theta. For d≠2 these block-index sets differ on an interval of length ~|d/2-1|N^theta. For d>2, Brownian loops in blocks N^theta<n<(d/2)N^theta are selected but have no random-walk counterpart; for d<2 the extra loops are on the random-walk side. The expected number of such unpaired loops is lambda * sum_{|z|<rN} sum_{n~N^theta} Q_d(n) ~ lambda r^d N^d N^theta N^{-theta(d/2+1)} = lambda r^d N^{d(1-theta/2)}, which is unbounded for every theta<2. Hence no one-to-one correspondence can hold on an event of probability tending to 1, regardless of the bridge couplings. The proof in Section 3.3 only controls bad events for N^theta<n<N^k, and (3.7) controls n>=N^k; the discrepancy interval is never addressed. Continuous-time d=2 also has a one-block boundary mismatch whose expected count ~N^{2-2theta} cannot be absorbed by cN^{-a} for arbitrary a. Only discrete-time d=2 aligns exactly.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a coupling between Brownian loop soups in R^d and random-walk loop soups on Z^d (both continuous- and discrete-time), claimed to hold for all d≥1 and for all polynomial scales, i.e. for every θ∈(0,2). The construction refines the Lawler–Trujillo Ferreras / Sapozhnikov–Shiraishi framework by introducing a block sequence {a_n} chosen so that the total mass of random-walk loops in block n equals the Brownian-loop mass in the corresponding time interval. The author then uses KMT-type bridge couplings to control the spatial and temporal errors for paired loops. The main theorems (Theorems 1.2 and 1.3) assert a one-to-one correspondence between random-walk loops with rescaled time > N^{θ−2} and Brownian loops with χ_N(t)>N^{θ−2}, with failure probability at most cλr^d N^{-a} for arbitrary a>0.","tokens_in":12887,"tokens_out":9624,"duration_ms":91515,"significance":"If the main theorems were correct, this would be a substantial advance: it would remove the long-standing restriction θ>2/3 in d=2 and θ>2d/(d+4) in d≥3, and would provide couplings at all polynomial scales with very small failure probability. The construction is elegant: the recurrence defining {a_n} makes the block masses match exactly by construction, and the proof transparently identifies the KMT estimates needed. Those are genuine strengths. However, the central claim is undermined by a mismatch between the two threshold conditions used in the theorem, as detailed below. The paper also contains useful intermediate results and a clear exposition of the continuous-time case.","major_comments":[{"comment":"The two threshold conditions in the theorem select different sets of block indices. For a Brownian loop in block n, χ_N(tγ)=n/N^2 by (1.13), so the condition χ_N(tγ)>N^{θ−2} is equivalent to n>N^θ. For a continuous-time random-walk loop in block n, the rescaled time is t_{\\tildeγ}=\\tilde T/(dN^2) with \\tilde T∈[2n,2n+2), so t_{\\tildeγ}>N^{θ−2} is equivalent, up to boundary effects, to n>(d/2)N^θ. Lemma 3.1 gives a_n=2n/d+O(1), so the coupling pairs block n with block n. Thus for d≠2 the selected block indices differ on an interval of length ~|d/2−1|N^θ. For d>2 the Brownian set contains extra blocks n∈(N^θ, dN^θ/2); for d<2 the random-walk set contains extra blocks n∈(dN^θ/2,N^θ). The expected number of such unpaired loops is of order λr^d N^{d(1−θ/2)}, which is unbounded for every θ<2. Hence the two sets cannot have a one-to-one correspondence on an event of probability tending to 1, le","section":"Theorems 1.2–1.3, Eq. (1.13), Lemma 3.1"},{"comment":"The proof does not address the discrepancy interval. In Section 3.3, the event A is defined only over N^θ<n<N^k, and the subsequent estimates (3.9)–(3.11) control only that range; (3.7) controls n≥N^k. The mismatch interval between (d/2)N^θ and N^θ is never treated. Consequently, even if one accepted the bridge estimates, the sentence on p. 11 that 'on the event Ac ... the coupling satisfies the conditions of Theorem 1.2' is unjustified: the event Ac says nothing about the extra loops in the discrepancy interval, which are precisely the loops that break the claimed bijection. The same gap is inherited by the discrete-time proof in Section 3.4.","section":"Section 3.3, event A; Section 3.4"},{"comment":"The mismatch is not only a factor-d/2 artefact. For d=2 in continuous time, the block-index thresholds agree asymptotically, but there is still a one-block mismatch at the boundary. For block n=N^θ, the random-walk condition t_{\\tildeγ}>N^{θ−2} is satisfied with probability 1 because \\tilde T∈[2N^θ,2N^θ+2), while the Brownian condition χ_N(tγ)>N^{θ−2} is not satisfied because χ_N=N^{θ−2}. The expected number of unmatched random-walk loops in this boundary block is of order λr^2N^{2−2θ}, which is unbounded for θ<1. Thus even in the dimension where the original Lawler–Trujillo Ferreras coupling works, the strengthened theorem fails for the range θ∈(0,1).","section":"Theorem 1.2, continuous-time d=2"}],"minor_comments":[{"comment":"In the displayed sum, the index in Q_d(n) should be Q_d(k); as written, the summand does not depend on the summation variable.","section":"Eq. (3.4)"},{"comment":"The variables Y(n,z;m) are described as 'complex random variables' but then are said to be uniform on a d-dimensional hypercube. For d≠2 they should be called random vectors, not complex random variables.","section":"Section 3.2"},{"comment":"In the definition of μcrw, the transition kernel is written p_t(x,y) but the integral is over z only; presumably this should be p_t(z,z) (or the integral should be over x,y with the kernel evaluated appropriately).","section":"Section 2.3"},{"comment":"For d≥3, the spatial error bound N^{(a−d)/(2d)} log N is not vanishing when a≥d. The theorem states 'for every a>0', which may mislead readers; Remark 1.4 does acknowledge this, but the main statement could be phrased more carefully.","section":"Theorem 1.3, Eq. (1.18)"}],"recommendation":"reject","confidential_remarks":"The central construction is potentially salvageable, but the main theorems as stated are false because the threshold conditions select different block indices. The author should be encouraged to reformulate the selection condition so that the two sides select the same blocks—for instance by applying the same 'block-index' functional to both rescaled times—and then resubmit. As it stands, the error is load-bearing and cannot be fixed by a local correction."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know up front that the central theorem of this paper is not correct. The construction pairs Brownian and random-walk loops block by block using a sequence a_n ~ 2n/d, but the selection conditions in Theorems 1.2 and 1.3 do not align on the two sides except in the discrete-time d=2 case. The Brownian side uses chi_N(t)>N^{θ-2}, which selects exactly blocks n>N^θ. The random-walk side uses t_{\\tildeγ}>N^{θ-2}, which for a loop in block n means n>(d/2)N^θ. For d>2 the Brownian set has extra blocks (N^θ,(d/2)N^θ); for d<2 the random-walk set has those extras. The expected number of unpaired loops is ~ λr^d N^{d(1-θ/2)}, unbounded for every θ<2, so no bijection can hold on an event of probability tending to one. Even in continuous time with d=2, a one-block boundary mismatch appears when N^θ is not an integer, and the expected extra loops ~ N^{2-2θ} already violate the claimed arbitrary-a error bound for small θ. Section 3.3 only controls bad events for N^θ<n<N^k and n≥N^k; the discrepancy interval is never addressed. This is a load-bearing flaw, not a technical gap.\n\nThat said, the paper is not careless. The observation that only the leading term of the loop-mass Taylor expansion is needed, and the definition of a_n via the recurrence (3.2) to make block masses match exactly, are genuinely new and would be useful if the targeting were fixed. The KMT coupling between continuous-time random walk bridges and Brownian bridges (Lemma 2.5) is a clean addition, and the exposition is clear. The citation to [1] as claiming sharpness is honest, and the author correctly identifies that the prior barrier may not be inherent.\n\nThe appropriate audience is researchers working on loop soup couplings and scaling limits. The idea may be salvageable by reformulating the theorem with a block-index condition on both sides (or by adding the unpaired loops in a controlled way). As written, the claim is false. I would not accept this version, but I would send it to peer review rather than desk reject: the construction is novel enough that a referee should document the mismatch and give the author a chance to fix it. If the fix works, the result would be a real advance.","headline":"The main theorem is false as stated: the Brownian and random-walk selection conditions pick different block indices for every d≠2 (and for continuous-time d=2), so the claimed one-to-one correspondence cannot hold; the underlying a_n construction is a good idea that might be salvageable.","tokens_in":13363,"tokens_out":8755,"would_cite":false,"duration_ms":74363,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J65","60G55","60J27"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper constructs a coupling between Brownian loop soups and random walk loop soups that works for every polynomial scale of loop length, in every dimension, for both discrete- and continuous-time random walks, with error probability th","keywords":["Brownian loop soup","random walk loop soup","coupling","KMT coupling","mesoscopic loops","polynomial scales","Poisson point process","continuous-time random walk"],"falsifier":"For d=1 and d=3, compute the expected number of continuous-time random walk loops with rescaled time > N^{θ-2} and of Brownian loops with χ_N(t_γ) > N^{θ-2}; their ratio converges to a constant different from 1, which would contradict the existence of a bijection on an event of probability tending to 1.","tokens_in":12334,"feed_emoji":"🌀","tokens_out":16517,"duration_ms":139138,"temperature":0.7,"pith_summary":"The paper claims to remove the long-standing restriction θ>2/3 in dimension 2 and θ>2d/(d+4) in higher dimensions for the coupling between Brownian and random walk loop soups. The new coupling works for all θ in (0,2), meaning it controls loops at all polynomial scales, including the previously inaccessible mesoscopic loops. The central new idea is a carefully chosen increasing sequence a_n ≈ 2n/d that aligns the block boundaries of the two loop soups, so that each block of random walk loops has exactly the same total mass as the corresponding block of Brownian loops. The result would matter because mesoscopic loops are believed to influence scaling limits of connectivity and multiplicative chaos, and no previous coupling controlled them simultaneously over a macroscopic region.","feed_headline":"All polynomial scales now coupled for loop soups","feed_subtitle":"A block-matching sequence removes the old size barrier, giving one-to-one pairings down to arbitrarily small mesoscopic loops.","key_machinery":"The key object is the increasing sequence {a_n} defined by the recurrence a_1^{-d/2} - a_n^{-d/2} = (2π)^{d/2}(d/2)Q_d(n) (and its discrete-time analogue), which satisfies a_n = 2n/d + O(1). It is used to define the time-slicing function χ_N, and it guarantees that the total mass of continuous-time random walk loops of length in [2n,2n+2] equals the total mass of Brownian loops of length in [a_n,a_{n+1}], enabling a block-by-block Poisson coupling. This sequence is what replaces the ad-hoc thresholds in earlier couplings and allows the removal of the θ lower bound.","core_discovery":"The main theorem asserts that for every d≥1, θ∈(0,2), and a>0, there exists a coupling of the continuous-time random walk loop soup and the Brownian loop soup such that, outside an event of probability at most cλr^d N^{-a}, there is a one-to-one correspondence between random walk loops with rescaled time larger than N^{θ-2} and Brownian loops with χ_N(t_γ) larger than N^{θ-2}, with time difference O(N^{-2}) and spatial difference O(N^{-1} log N) (or a weaker bound in d≥3 for discrete time). The proof constructs the Brownian loop soup from the random walk loop soup by using a sequence a_n defined by a recurrence that matches the loop mass in each block, together with a KMT-type bridge couplin","pith_inferences":["The threshold alignment in the theorem statement appears to rely on a_n ≈ 2n/d matching the random-walk time rescaling; this holds exactly only for d=2, so for other dimensions the two sets in the theorem may have different cardinalities and the claimed bijection may need the thresholds adjusted, for example by replacing N^{θ-2} with (2/d)N^{θ-2} on the random-walk side.","If such an adjustment is made, the same block-matching proof would likely go through, suggesting the main mathematical contribution is the a_n-sequence construction rather than the exact threshold values in the theorem.","The new KMT coupling for continuous-time random walk bridges in all dimensions could be applied to other problems requiring strong approximations of random walk paths, independent of the loop soup context."],"forward_implications":["If correct, the coupling controls mesoscopic loops of diameter as small as N^{-1+ε} for any ε>0, which were previously inaccessible.","The error probability can be made N^{-a} for any a>0 (with a trade-off in the spatial bound for d≥3), much stronger than earlier polynomial bounds.","The result applies in all dimensions d≥1 and both discrete- and continuous-time random walks, with a KMT bridge coupling obtained for the continuous-time case.","It provides a route to quantitative convergence rates for random walk loop soup cluster boundaries to CLE, since global control of mesoscopic loops is needed.","The block-matching construction is simple enough that it may generalize to other discrete/continuous process pairs whose loop measures can be matched by reparametrization."],"fun_headline_variants":["Coupling loop soups at all polynomial scales","Loop soup coupling without scale restriction","All loop sizes now pair Brownian and random walk soups","New coupling removes loop-size barrier for soups"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof assumes that the two threshold conditions in the theorem select exactly the same collection of block indices; this alignment is exact only when the constant in a_n ≈ 2n/d matches the random-walk time rescaling (d=2), so for d≠2 the two sets may not have equal sizes.","fun_headline_variants_meta":{"raw":{"variants":["Coupling loop soups at all polynomial scales","Loop soup coupling without scale restriction","All loop sizes now pair Brownian and random walk soups","New coupling removes loop-size barrier for soups"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001087,"raw_usage":{"total_tokens":4441,"prompt_tokens":866,"completion_tokens":3575,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":610,"completion_tokens_details":{"reasoning_tokens":3519}},"tokens_in":610,"tokens_out":3575,"duration_ms":25261,"temperature":1.0,"reasoning_tokens":3519,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T12:27:38.785838+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For d=1 and d=3, compute the expected number of continuous-time random walk loops with rescaled time > N^{θ-2} and of Brownian loops with χ_N(t_γ) > N^{θ-2}; their ratio converges to a constant different from 1, which would contradict the existence of a bijection on an event of probability tending to 1.","supporting_citations":[],"review_version":1}