Pith. sign in

REVIEW 3 major objections 5 minor 5 references

Myopic non-intersection in a periodic potential

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read This paper proves that myopic non-intersecting Brownian motions in a periodic potential converge, in a large-potential, large-foresight regime, to a discrete myopic random walk whose endpoints are TASEP and non-colliding Poisson walks.

desk verdict New interpolation family with a real algorithmic idea, but Theorem 1.2's proof rests on an unproved near-integer estimate for the conditioned process. read the letter →

arxiv 2506.05246 v1 pith:JJYD54MA submitted 2025-06-05 math.PR math-phmath.MP

Jonas Arista , Daniel Remenik , Avelio Sepúlveda This is my paper
classification math.PRmath-phmath.MP MSC 60J6060K3560F1782C22
keywords myopicnon-intersectionperiodicpotentialmetastabilityTASEPnon-intersectingrandomwalksacceptance-rejectionsamplingKPZuniversalityCharlierensemble
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

This paper introduces a class of Markov processes with 'myopic non-intersection': at every instant the particles are conditioned to avoid each other only over a moving window of length $T$, rather than forever. It proves that for Brownian particles in a periodic potential with drift, when the potential strength $\kappa$ and the foresight $T^\kappa$ both become large with $T^\kappa/\lambda_\kappa\to L>0$ and $\lambda_\kappa=e^{2\kappa+o(\kappa)}$, the integer sites visited by the particles converge to a myopic non-intersecting random walk with the same rescaled foresight $L$. As $L\to 0$ the discrete walk collapses to exclusion dynamics (TASEP), and as $L\to\infty$ it becomes a system of non-colliding Poisson walks, the discrete counterpart of Dyson Brownian motion. The paper's main technical contribution is an acceptance-rejection algorithm that builds these myopic processes directly, without a limiting procedure, and this algorithm is what makes the coupling between the continuous and discrete models possible.

What carries the argument

The load-bearing object is the acceptance-rejection algorithm (Algorithm A for walks, Algorithm B for Brownian motions): at each restart time $t_n$, sample a fresh copy of the system conditioned to avoid collisions for the next $T$ time units, keep its trajectory only up to $T$ before its first collision time $\tau_{n+1}$, set $t_{n+1}=t_n+\tau_{n+1}-T$, and restart from the endpoint. The paper proves that this concatenation is a time-homogeneous Markov process and equals the $\varepsilon\to 0$ gluing definition. On the discrete side the target $Y^{(L)}$ is defined by the generator with ratios $h_L(y\pm e_i)/h_L(y)$, where $h_L(y)$ is the probability that independent walks survive in the Weyl chamber for time $L$; those ratios become exclusion indicators as $L\to 0$ and Vandermonde ratios as $L\to\infty$. The proof of the main theorem couples the two algorithms term by term, using the metastability scale $\lambda_\kappa=e^{2\kappa+o(\kappa)}$ and the coupling lemma that brings independent copies of the diffusion together after time $e^{\alpha\kappa}$.

What would settle it

Set $N=2$, start both particles near the same integer well with $\kappa$ large and $T^\kappa=L e^{2\kappa}$, and compute or simulate the law of the conditioned process at time $T^\kappa$ modulo 1. If the probability of lying in $\mathbb{Z}+[-1/4,1/4]$ does not tend to 1, or if a positive fraction of the mass concentrates near half-integers, then condition (2) in the proof of Theorem 1.2 fails and the coupling between the discrete and continuous algorithms breaks. A cheaper check compares this conditioned probability with the unconditioned bound of Lemma 4.9: a positive gap as $\kappa\to\infty$ would show the proof as written is incomplete, even if the theorem itself survives.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.2: if $X^{(T^\kappa)}$ is a system of myopic non-intersecting Brownian motions in a periodic potential with foresight $T^\kappa$, and $T^\kappa/\lambda_\kappa\to L>0$ with $\lambda_\kappa=e^{2\kappa+o(\kappa)}$, then the projected process $[X^{(T^\kappa)}](\lambda_\kappa\,\cdot)$ converges in distribution, in the local Skorohod topology, to $Y^{(L)}$, the myopic non-intersecting random walk with foresight $L$. Theorem 1.1 identifies the two ends of the discrete family: as $L\downarrow 0$, $Y^{(L)}$ becomes TASEP; as $L\uparrow\infty$, it becomes a system of Poisson random walks conditioned never to intersect. The continuous model therefore has a discrete skeleton that encodes the competition between the confining potential and the finite-horizon repulsion.

Load-bearing premise

The proof of Theorem 1.2 assumes that at each restart time the conditioned process lies within a quarter of a unit of an integer vector with probability close to 1, although the paper proves that near-integer property in Lemma 4.9 only for the unconditioned diffusion, and the non-intersection conditioning up to time $T^\kappa$ is an exponentially rare event that could bias the particle locations.

Editorial extensions

If this is right

  • Quantitative questions about the continuous myopic system, such as gap distributions, occupation statistics, or collision rates, can be studied through the countable-state random walk $Y^{(L)}$, whose generator is explicit.
  • The same parameter $L$ interpolates between the exclusion regime and the non-colliding random-matrix regime, so the paper supplies a genuine one-parameter family connecting those two worlds rather than two unrelated limits.
  • Sending $L\to\infty$ after $\kappa\to\infty$ gives non-intersecting Poisson processes (Remark 1.3), which supports the authors' conjecture that full non-intersection conditioning washes out the confining effect of the periodic potential.
  • Algorithms A and B give explicit simulation procedures for both the discrete and continuous myopic processes at finite parameters, not merely in the limit.

Reading between the lines

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

  • The acceptance-rejection restart scheme looks like a general recipe: it should define a myopic variant of any Markov process whose finite-horizon survival probability is positive, not just Poisson walks and Brownian motions. The paper only needs these two cases, so the general statement is an extension, not a claim made here.
  • Because $Y^{(L)}$ is given by explicit generator ratios, one could expand the ratios in powers of $L$ to compute finite-foresight corrections to TASEP currents or gap statistics; the paper does not carry out such an expansion.
  • One could also study the myopic random walk with general initial profiles or multi-species labels, where the interpolation between exclusion and non-colliding behavior may produce new crossover processes; the paper restricts to ordered initial data in the Weyl chamber.
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

3 major / 5 minor

Summary. The paper introduces a class of Markov processes, called myopic non-intersecting Brownian motions (mBM), in which N independent Brownian motions in a periodic potential are dynamically conditioned to avoid collisions over a moving time window of length T. The authors construct this process through an acceptance-rejection-type algorithm and prove that, as the potential strength κ and the foresight Tκ both tend to infinity with Tκ/λκ → L (where λκ = e^{2κ+o(κ)}), the rescaled integer-valued processes [X^{(Tκ)}](λκ·) converge to a myopic non-intersecting random walk Y^{(L)} with foresight L. They also show that Y^{(L)} interpolates between TASEP (L → 0) and non-colliding Poisson random walks (L → ∞). The main technical contribution is the explicit algorithmic construction of the myopic processes and a coupling proof of the convergence theorem.

Significance. If the main theorem is correct, the paper establishes a novel interpolation between exclusion dynamics and non-intersecting random walks arising from a continuous diffusion model. The algorithmic construction via acceptance-rejection sampling is a useful and potentially transferable tool, and the proofs are largely based on explicit couplings and classical metastability results rather than fitted parameters. The main theorem is falsifiable and the paper contains several intermediate statements (Lemmas 4.6, 4.8, 4.9) that are checked by direct arguments. However, as detailed below, one load-bearing step in the proof of Theorem 1.2 is not supported by the stated lemmas, and the statement of Theorem 1.2 has an initial-condition gap.

major comments (3)
  1. [Section 4.2, proof of Theorem 1.2, condition (2)] The proof of condition (2) begins with the assertion that, with probability larger than 1−ε, [qX^{(Tκ)}](Tκ) = [qX^{(Tκ)}(Tκ)] for large enough κ. This is not a consequence of Lemma 4.9, which applies to the unconditioned system Xκ of independent solutions and only gives Xκ(t) ∈ Z+[−β,β] for t > e^{ακ}. Lemma 4.9 neither identifies the last visited integer with the nearest integer nor covers the conditioned process qX^{(Tκ)}, whose law is a Doob h-transform with an additional repulsive drift. The subsequent display also uses sup_{t∈[0,Tκ/2]} P(qX^{(Tκ)}(t) ∉ Ω_Z^N + [−1/4,1/4]^N), which is not controlled by Lemma 4.9. Since condition (2) is one of the four conditions required at every iteration of the coupling between Algorithms A and B, the induction proving Theorem 1.2 is incomplete as written. A proof of the near-integer property for the conditioned process, with uniform control over the relevant random initial conditions, is needed.
  2. [Theorem 1.2 statement] The hypothesis x ∈ Ω_N with x_i ∉ Z + 1/2 for each i does not imply [x] ∈ Ω_Z^N. For example, with N = 2 and x = (−0.1, 0.1), both coordinates are in Ω_N and neither is a half-integer, but [x] = (0,0) ∉ Ω_Z^N. The limiting process Y^{(L)} is defined only on Ω_Z^N, so the statement is not well-posed for such initial data. Moreover, the proof begins by taking x ∈ Ω_Z^N + [−1/4,1/4]^N, which is a strictly stronger assumption. Please add the missing condition (for instance, that the integer parts of x are strictly ordered) or explain how the boundary case is handled.
  3. [Section 4.2, Lemma 4.8] In the proof of Lemma 4.8, the claim that P(X^κ_1(τ^κ) ∈ B^κ_ε) < ε for large κ is justified by a contradiction with convergence of ([X^κ_1], [X^κ_2]) to independent Poisson processes, but the contradiction is not demonstrated. Two independent Poisson processes may both jump in the interval [τ^κ, τ^κ + e^{ακ}], so a positive lower bound on the probability of two jumps in that interval does not by itself contradict Skorohod closeness; the argument needs to use explicitly that the rescaled interval length e^{ακ}/λκ tends to 0. Since Lemma 4.8 is used in the proof of condition (1) and in the estimate (4.6), this step should be completed or replaced by a more detailed argument.
minor comments (5)
  1. [Throughout] The spelling 'Skorohod' should be 'Skorokhod' (for example in Theorem 1.2 and Lemma 4.4).
  2. [Definition 3.1] In the displayed generator formula, the arguments are inconsistent: the second term uses F(x) and h_L(x) where F(y) and h_L(y) are intended. Please correct the notation.
  3. [Proposition 3.7] The assertion that P_x(t_1 ≥ η) ≥ 1/2 uniformly in x ∈ Ω_N is stated without proof. Since t_1 = τ_1 − T, the argument should use Proposition 2.3 to get a uniform lower bound on the gap at time T and then a uniform lower bound on the probability that the post-T independent evolution does not collide for an additional time η.
  4. [Lemma 4.6] The function g(κ,δ) in (4.2) is never explicitly defined. The proof bounds failure probabilities, so it would be helpful to define g as the infimum of the success probability of the constructed coupling over the stated range of h, x, and \bar{x}.
  5. [Proof of Theorem 1.2] At the beginning of the proof, the text says 'couple X(λκ·) with Y(·)', but Proposition 4.3 gives a coupling between [X](λκ·) and Y(·). This imprecision matters because the acceptance-rejection event for the continuous processes is later related to the discrete one via Lemma 4.8.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the proof chain rests on external metastability results and generator asymptotics; the restart near-integer estimate is a proof gap, not a circular step.

full rationale

The paper's derivation is self-contained against external benchmarks. Theorem 1.1's L→∞ endpoint is obtained from the external asymptotic [EK08, Thm. 1.1] for h_L, and the L→0 endpoint follows by direct generator convergence to ASEP; neither reduces the mRW definition to its conclusion by construction. Theorem 1.2 is proved by coupling the acceptance-rejection algorithms for qX^(Tκ) and qY^(L), using Proposition 4.3 (metastability of the single diffusion, from external results [GOV87, OV05]) and Lemma 4.8. No fitted parameter is renamed as a prediction, and the only self-citations ([MQR21] in the introduction and the simulation link [Sim]) are not load-bearing. I flag, as a proof-completeness concern rather than circularity, restart condition (2) in the proof of Theorem 1.2: the text asserts 'with probability larger than 1−ε, [qX^(Tκ)](Tκ) = [qX^(Tκ)(Tκ)] for large enough κ' and then uses Lemma 4.9, which is stated for the unconditioned process Xκ, to control quantities for the conditioned process qX^(Tκ). This is a missing estimate that could break the coupling induction if it cannot be supplied, but it is not a reduction of the theorem's conclusion to its own inputs by construction, so it does not raise the circularity score.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No free parameters are fitted; all constants (κ, T, L, N, b) are model inputs. The axioms are standard results or explicit model assumptions. No new physical entities are introduced; the myopic processes are new stochastic objects but not entities with independent falsifiable handles.

assumptions (6)
  • domain assumption The potential v is C∞, 1-periodic, has a unique local minimum at 0 in [-1/2,1/2] with v(0)=0, a unique local maximum at 1/2 in [0,1] with v(1/2)=1, and is adjusted so the critical points are at the specified locations.
    Section 1.2.1 and footnote 1; used to define the metastable boxes and to ensure λκ=e^{2κ+o(κ)}. The authors state the drift changes critical points for the natural trigonometric example and that this can be handled, but they assume it away for notation.
  • standard math The classical metastability theorems for Brownian motion in a double-well potential ([OV05, Thm 5.5 and 5.6]) apply to the rescaled periodic potential; Theorem 4.1 is stated as a slight modification.
    Used in Proposition 4.3, Lemma 4.6, Lemma 4.8, and Lemma 4.9; the paper argues the modifications are straightforward but does not prove them from first principles.
  • standard math Gaussian derivative estimates for the heat kernel of the diffusion (2.2), from [Fri64, Sec 9.6], hold uniformly on compact sets and for derivatives.
    Used throughout Section 2 for dominated convergence and positivity arguments in Propositions 2.1 and 2.3.
  • standard math The Karlin-McGregor determinant formula (2.3) holds for the diffusion (2.1).
    Used in the proofs of Propositions 2.1 and 2.3 to represent non-intersection probabilities as determinants.
  • standard math The asymptotic h_L(x) ~ C L^{-N(N-1)/4} Δ(x) as L→∞, from [EK08, Thm 1.1].
    Used in Proposition 3.3 to show the mRW converges to non-colliding random walks as L→∞.
  • domain assumption The initial condition x∈Ω_N with x_i∉Z+1/2, so the system starts in the Weyl chamber away from half-integers.
    Assumed in Theorem 1.2 so that the integer tracking [X] is well-defined and the metastable regime starts inside a box.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Myopic non-intersection in a periodic potential." pith.science (2026). https://pith.science/paper/JJYD54MA

@misc{pith2026250605246,
  author       = {Pith},
  title        = {Pith review of: Myopic non-intersection in a periodic potential},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JJYD54MA}},
  note         = {Machine review of arXiv:2506.05246}
}
read the original abstract

We introduce a class of Markov processes conditioned to avoid intersection over a moving time window of length T>0, a setting we refer to as myopic non-intersection. In particular, we study a system of myopic non-intersecting Brownian motions subject to a periodic potential. Our focus lies in understanding the interplay between the confining effect of the potential and the repulsion induced by the non-intersection constraint. We show that, in the long time limit, and as both T and the strength of the potential become large, the model converges to a system of myopic non-intersecting random walks, which transitions between standard non-intersection dynamics and exclusion behavior. The main technical contribution of the paper is the introduction of an algorithm, based on a modification of the acceptance-rejection sampling scheme, that provides an explicit construction of myopically constrained systems.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

5 extracted references · 5 canonical work pages

  1. [1]

    Andréief

    [And86] C. Andréief. Note sur une relation entre les intégrales définies des produits des fonctions. Mém. Soc. Sci. Phys. Nat. Bordeaux 2.3 (1886), pp. 1–14. [BF18] A. Borodin and P. L. Ferrari. Random tilings and Markov chains for interlacing particles. Markov Process. Relat. Fields 24.3 (2018), pp. 419–451. [Bis+23] E. Bisi, Y . Liao, A. Saenz, and N. Z...

    work page 2018

  2. [24]

    Matetski, J

    [MQR21] K. Matetski, J. Quastel, and D. Remenik. The KPZ fixed point. Acta Math. 227.1 (2021), pp. 115–203. [OV05] E. Olivieri and M. E. Vares. Large deviations and metastability

    work page 2021

  3. [2005]

    www.tinyurl.com/mwptw5d9 or www.youtube.com/playlist?list=PLXnTQY9sizpJGmjfeeETXlEXWFb_ cEaxP

    [Sim] Myopic non-intersecting random walks simulation. www.tinyurl.com/mwptw5d9 or www.youtube.com/playlist?list=PLXnTQY9sizpJGmjfeeETXlEXWFb_ cEaxP. [TW07] C. A. Tracy and H. Widom. Nonintersecting Brownian excursions. Ann. Appl. Probab. 17.3 (2007), pp. 953–979. [TW94] C. A. Tracy and H. Widom. Level-spacing distributions and the Airy kernel.Commun. Mat...

    work page 2007

  4. [2012]

    Galves, E

    [GOV87] A. Galves, E. Olivieri, and M. E. Vares. Metastability for a class of dynamical systems subject to small random perturbations. The Annals of Probability (1987), pp. 1288–1305. [Gra99] D. J. Grabiner. Brownian motion in a Weyl chamber, non-colliding particles, and random matrices. Ann. Inst. Henri Poincaré, Probab. Stat.35.2 (1999), pp. 177–204. [J...

    work page 1987

  5. [2013]

    Why random matrices share universal processes with interacting particle systems?

    arXiv: 1312.1126[math.PR]. [Fri64] A. Friedman. Partial differential equations of parabolic type. Prentice-Hall Inc. Englewood Cliffs NJ, 1964, pp. xiv+347. [FW12] M. I. Freidlin and A. D. Wentzell. Random perturbations of dynamical systems. Translated from the Russian by J Szücs. 3rd ed. V ol

    work page Pith review arXiv 1964

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.