{"id":"a2523aa5-ed15-4977-b83c-6df06763b9cb","arxiv_id":"2411.14766","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For any repulsion strength alpha below 1/2, an axis-driven random walk on the first quadrant is transient and superdiffusive, with distance scaling like n^(1/(2(1-alpha))).","lead":"A random walk on the square grid that gets pushed outward only when it touches the axes turns out to run away from the origin much faster than ordinary diffusion. The paper gives the exact speed and the distribution of how far the walk has gone after a long time.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Right-tail formula in Theorem 1 is inconsistent with Corollary 2.3: substituting the threshold into the excursion-count tail gives argument (a c1)^(1-alpha), not (c1/a)^(2(1-alpha)), and the printed version can violate probability bounds.","rationale":"The reader's weakest assumption is the coupling Lemma 2.1, whose proof is sketched and whose displayed event is likely misprinted: as written, it requires the walk to stay on a single axis for the whole interval, which has probability tending to 0 for alpha in (0,1/2). I agree the coupling argument needs repair and is load-bearing for transferring results from Z_tilde to Z. However, the more decisive issue I find is a direct algebraic inconsistency in the main theorem's right tail. The stated RHS G_{1/2}((c1/a)^{2(1-alpha)}) cannot be correct: for small a it tends to 1, whereas the tail P(Z_n >= a^{-1} n^{1/(2(1-alpha))}) must tend to 0, and the paper's own Corollary 2.3, when substituted correctly, gives G_{1/2}((a c1)^{1-alpha}). This is not a gap in a lemma but an error in the central claimed formula. It is evidently fixable, since the left tail and the stable-subordinator framework are coherent, so I do not move the verdict to REJECT; I keep CONDITIONAL and specify the required correction. I also acknowledge the paper's independent strengths: explicit moment recursions, a self-contained Section 3, and a clear stable-subordinator heuristic for the excursion count. Those make the left tail and the scaling exponent plausible, but the right-tail formula must be corrected before the theorem can be accepted as stated.","tokens_in":21312,"tokens_out":23366,"duration_ms":218767,"concrete_test":"Re-derive the right-tail step of Proposition 2.4 by substituting the threshold into Corollary 2.3: solve c1 (N_n)^{1/(1-alpha)} >= a^{-1} n^{1/(2(1-alpha))} for N_n, obtaining N_n >= n^{1/2} (a c1)^{-(1-alpha)}, and compare u = (a c1)^{1-alpha} with the printed (c1/a)^{2(1-alpha)}. Then check the consistency inequality P(Z_n <= a n^{1/(2(1-alpha))}) + P(Z_n >= a^{-1} n^{1/(2(1-alpha))}) <= 1 for a fixed small a; the printed right tail makes the sum exceed 1, while the corrected argument keeps it below 1.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim includes the right tail P(Z_n >= a^{-1} n^{1/(2(1-alpha))}) -> G_{1/2}((c1/a)^{2(1-alpha)}). This is algebraically inconsistent with the paper's own Corollary 2.3. There, the right tail for the excursion count is P(N_n >= n^{1/2} u^{-1}) -> G_{1/2}(u), with G_{1/2} a 1/2-stable distribution function, so G_{1/2}(x) -> 1 for large x and -> 0 for small x. From Proposition 2.4's approximation X_n ~ c1 (N_n)^{1/(1-alpha)}, the event X_n >= a^{-1} n^{1/(2(1-alpha))} is equivalent to N_n >= n^{1/2} (a c1)^{-(1-alpha)}. Thus u^{-1} = (a c1)^{-(1-alpha)}, so u = (a c1)^{1-alpha}. The correct right tail is therefore G_{1/2}((a c1)^{1-alpha}), which tends to 0 as a -> 0, as a large-deviation tail must. The printed argument (c1/a)^{2(1-alpha)} is large for small a, so the printed RHS tends to 1, not 0. This contradicts the intended tail behavior and can violate the union bound together with the left tail: for alpha = 0.1 and a = 0.001, the left tail is about 0.12 while the printed right tail is about 1, giving sum > 1. The proof of Proposition 2.4 only says the right tail follows from Corollary 2.3 without showing the algebra, so the error is not caught. This is not merely a typo in one constant: the stated form of the main theorem's right tail is false as written, although the method likely yields the corrected formula.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies an axis-driven nearest-neighbour random walk on the first quadrant of Z^2: in the interior of the quadrant it performs simple random walk, while on the coordinate axes it has a drift away from the origin with probability governed by a parameter α>0. The main theorem states that for 0<α<1/2 the dominant coordinate Z_n is of order n^{1/(2(1-α))}, with explicit left-tail constant c_2(a/c_1)^{(1-α)/2} and a right tail expressed through a 1/2-stable distribution. The proof combines a law of large numbers for the positions at successive returns to the axes, a study of the number of axis-excursions, and a coupling to a one-sided walk with a reflecting boundary.","tokens_in":21667,"tokens_out":23629,"duration_ms":245464,"significance":"If the results were fully established, they would provide a clean and interesting counterpart to the renewal-case paper [AD23]: an arbitrarily small repulsive force on the axes changes the walk from recurrent/diffusive to transient/superdiffusive, with explicit constants. The strength of the paper is its detailed moment analysis in Section 3 and the explicit computation of the constant c_1; the reduction of the fluctuation count to a 1/2-stable subordinator is a promising approach. However, the main theorem as stated contains an algebraic error in the right tail, the left tail appears inconsistent with the stable-subordinator scaling, and the coupling lemma connecting Z to the auxiliary walk is only sketched; these are central and require a revision.","major_comments":[{"comment":"The right-tail formula is algebraically inconsistent with Corollary 2.3. Under the approximation X_n ≈ c_1 (N_n)^{1/(1-α)} used in the proof, the event {X_n ≥ a^{-1} n^{1/(2(1-α))}} corresponds to {N_n/n^{1/2} ≥ (a c_1)^{-(1-α)}}. Since Corollary 2.3 gives P(N_n/n^{1/2} ≥ u^{-1}) → G_{1/2}(u), the limit should be G_{1/2}((a c_1)^{1-α}), not G_{1/2}((c_1/a)^{2(1-α)}). The printed expression tends to 1 as a→0, whereas the correct tail should tend to 0; for α=0.1 and a=0.001 it also violates the union bound together with the left tail. This is a load-bearing error in the statement of the main theorem.","section":"Theorem 1; §2.3, proof of Proposition 2.4"},{"comment":"Lemma 2.1 is the only place where the original walk Z is coupled to the one-sided walk Z̃, and Proposition 2.2, Corollary 2.3, and Proposition 2.4 are all proved for Z̃. The proof of the lemma is a sketch: it asserts that N_n is of order n^{1/2}, that the walk reaches distance n^{(1-δ)/(2(1-α))} before time n, and that from such a distance it is impossible to reach the other axis, but none of these assertions is supplied with a quantitative probability bound that tends to 1. The sentence 'even if it requires adjusting ϵ according to δ' is not a proof. Since the theorem for Z inherits all tail constants from Z̃, this coupling must be proved rigorously or replaced by a direct argument.","section":"§2.1, Lemma 2.1"},{"comment":"The proof of Lemma 2.6 contains a product estimate that does not match the model: the displayed P_{(y,0)}(X_{ρ^{Z̃}} - x > ϵ n^{1/(2(1-α))}) = ∏_{m=y}^{x+ϵ n^{1/(2(1-α))}} (1 - m^{-α/2}) uses m^{-α/2}, whereas the horizontal-axis transition probabilities of Z̃ are 1 - (2m^α)^{-1}. In addition, the Gaussian-type bounds (7), (8), and (10) are asserted from a diffusion heuristic rather than proved for the discrete random walk. Because Lemma 2.6 controls the event C_{ϵ,n} that the last excursion before n does not affect the normalization, this is another load-bearing gap in Proposition 2.4.","section":"§2.3, Lemma 2.6"},{"comment":"The left tail in Corollary 2.3 appears to have an exponent error. From Proposition 2.2, ρ^Z̃_i ≈ i^2 V_{1/2}(1) in law for a 1/2-stable subordinator V_{1/2}; hence P(N^Z̃_n ≤ n^{1/2}u) = P(ρ^Z̃_{⌊n^{1/2}u⌋} ≥ n) → P(u^2 V_{1/2}(1) ≥ 1) ∼ C u by the usual tail behaviour of V_{1/2}(1), not c_2 u^{1/2}. If this is not a typographical issue, the left-tail statements in Corollary 2.3 and Theorem 1, including the exponent (1-α)/2, need to be re-derived.","section":"§2.2, Corollary 2.3 and §2.3, Theorem 1"}],"minor_comments":[{"comment":"The symbol Z is used for both the original walk and the auxiliary one-sided walk; this makes Lemma 2.1 and Proposition 2.4 unnecessarily confusing, and a distinct symbol such as Z̃ should be used throughout.","section":"§2.1"},{"comment":"The caption reads 'Transition probabilities Transition probabilities of Z'; the duplicated phrase should be removed.","section":"Figure 2"},{"comment":"There is a typo in the displayed sum: 'P_{j≤i}(Z_{ρ_j} - Z_{ρ_j})' should presumably be 'P_{j≤i}(Z_{ρ_j} - Z_{η_j})' or the intended centered expression; please correct it.","section":"§1, around Eq. (4)"},{"comment":"The section title 'Authorised the back-return on the axis' is ungrammatical; it should be something like 'Allowing back-return on the axis'.","section":"§4"},{"comment":"The phrase 'for any small u > 0' is informal; since the left-tail expression c_2 u^{1/2} exceeds 1 for u ≥ (1/c_2)^2, the intended range of validity should be stated explicitly.","section":"Theorem 1 and Corollary 2.3"}],"recommendation":"major_revision","confidential_remarks":"The paper is a single-author follow-up to [AD23], which is natural and not a scope problem. The main theorem is not acceptable in its current form because of the right-tail algebra and the apparent left-tail exponent issue, but both appear fixable within the manuscript's method. The bigger risk is the coupling lemma, which is load-bearing and currently only sketched; I would want a complete proof before recommending acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Start with the punchline: the paper's main theorem, as printed, has a wrong right tail. The algebra from Corollary 2.3 and Proposition 2.4 gives G_{1/2}((a c1)^{1-alpha}), not G_{1/2}((c1/a)^{2(1-alpha)}). For small a the printed RHS tends to 1 while the event is a large deviation; the error is real and can violate the union bound with the left tail. This is the biggest issue, but it is an algebraic slip in one place, not a flaw in the overall method.\n\nThe genuinely new piece is the repulsive axis-driven walk and its superdiffusive transient regime. For 0<alpha<1/2 the coordinate scales as n^{1/(2(1-alpha))} and the tails are explicit 1/2-stable. That is not in [AD23], which treats the attractive/renewal case. The moment machinery is substantial: recurrence for E(Z_rho_i), covariance bounds, and a law of large numbers for Z_rho_i are all worked out in detail, and the imported local-limit estimates (18)-(20) are published and parameter-free, so the circularity burden is low.\n\nThe soft spots are mostly in the writeup. Lemma 2.1, the coupling lemma that carries the whole transfer from Z to the one-sided Z_tilde, is both sketched and misstated: the event should be \"one coordinate stays positive\" (never reaches the opposite axis), not \"one coordinate stays zero\" as printed. The proof gives the right intuition (a far-away coordinate on the chosen axis makes the opposite axis unreachable within diffusive cone excursions) but it is not a full proof. Lemma 2.6 has a product (1 - m^{-alpha/2}) that looks like a misprint; minor if so. The abstract and title overstate the scope: the theorem is for the first quadrant, and Section 4 explicitly says the full Z^2 case is not handled. The side remark on alpha >= 1 is too quick to take seriously.\n\nWho this is for: random-walk people, especially those working on inhomogeneous walks and cones. The result is a solid extension of a known model, not a paradigm shift. It deserves a serious referee: the core idea is plausible, the error is correctable, and the proof structure is detailed enough to check. I would not cite the current version because the main theorem is false as stated, but I would cite a corrected version.\n\nRecommendation: send to peer review, with the expectation of major revision before acceptance.","headline":"Genuinely new superdiffusive regime for a repulsive axis-driven walk, but the main theorem's right tail is wrong as printed and the key coupling lemma is only sketched; the core idea is plausible and worth refereeing after fixes.","tokens_in":22238,"tokens_out":8130,"would_cite":false,"duration_ms":67380,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J10","60F05"],"pacs":[],"model":"deepseek-v4-flash","headline":"A random walk on the positive quadrant of Z^2, pushed away from the origin only along the axes, is transient and superdiffusive for every repulsion strength alpha < 1/2, with explicit tail asymptotics.","keywords":["axis-driven random walk","inhomogeneous random walk","transience","superdiffusive behaviour","1/2-stable distribution","random walk in a cone","tail asymptotics","law of large numbers"],"falsifier":"Simulate the walk for a fixed small $\\alpha$, say $\\alpha=0.1$, and for large $n$ estimate $\\mathbb{P}(Z_n \\le a\\,n^{1/(2(1-\\alpha))})$ at several small $a$; if the ratio of that probability to $(8/\\sqrt{\\pi})(a/c_1)^{(1-\\alpha)/2}$ does not approach 1, or if the fraction of trajectories that visit both axes after time $n^{1-\\epsilon}$ does not tend to 1, the central claim fails.","tokens_in":21052,"feed_emoji":"🎲","tokens_out":12791,"duration_ms":107829,"temperature":0.7,"pith_summary":"The paper studies a nearest-neighbour walk on the positive quadrant of $\\mathbb{Z}^2$ that behaves as a simple random walk inside the cone $xy\\neq 0$, but on an axis at distance $i$ it is pushed one step farther out with probability $1-(2i^\\alpha)^{-1}$. The claim is that this axis-only repulsion, for every $0<\\alpha<1/2$, changes the walk's character completely: it is transient and superdiffusive, with the dominant coordinate typically of order $n^{1/(2(1-\\alpha))}>\\sqrt{n}$. The proof derives matching left and right tails for $Z_n$, the left tail a power law with explicit constant $c_2=8/\\sqrt{\\pi}$ and the right tail a $1/2$-stable distribution. The author's point is that the diffusive motion inside the cones does not slow the walk down; it provides the $1/2$-stable count of axis visits that the axis drift amplifies into a superdiffusive scale.","feed_headline":"A tiny push on the axes makes a 2D walk escape faster than diffusion","feed_subtitle":"New tail asymptotics show that even minimal axis repulsion makes the walk transient and superdiffusive.","key_machinery":"The machinery is the excursion decomposition: with $\\eta_i$ the $i$-th time the walk hits an axis and $\\rho_i$ the next return to the cone, write $Z_{\\rho_i}=\\sum_{j=1}^i(Z_{\\rho_j}-Z_{\\eta_j})+\\sum_{j=1}^i(Z_{\\eta_j}-Z_{\\rho_{j-1}})$ and show the first, axis-run sum dominates. The paper obtains a law of large numbers for $Z_{\\rho_i}$ from a one-step recurrence for the mean (Corollary 3.6) and a vanishing covariance bound (Proposition 3.8), then couples $Z$ to a one-sided walk $\\tilde Z$ whose only $\\alpha$-push is on one axis. That coupling makes the excursion count a renewal process with a $1/2$-stable subordinator limit, so the left and right tail constants come from stable-renewal theory and the arcsine law.","core_discovery":"On the paper's own terms, the discovery is a phase statement: once $\\alpha>0$, the walk can no longer return to the origin, and its dominant coordinate obeys the two tail limits stated in Theorem 1. For any fixed small $a>0$, $$\\lim_{n\\to\\infty} \\mathbb{P}(Z_n \\le a\\,$n^{{1/(2(1-\\alpha))}}$) = \\frac{8}{\\sqrt{\\pi}}\\left(\\frac{a}{c_1}\\right)^{(1-\\$\\alpha$)/2}, \\qquad c_1=(2(1-\\$\\alpha$))^{1/(1-\\$\\alpha$)},$$ and $$\\lim_{n\\to\\infty} \\mathbb{P}(Z_n \\ge $a^{{-1}}$\\,$n^{{1/(2(1-\\alpha))}}$) = G_{1/2}\\big((c_1/a)^{2(1-\\$\\alpha$)}\\big),$$ where $G_{1/2}$ is a $1/2$-stable distribution decaying faster than $e^{-a^{-1/2}}$ as $a\\to0$. The mechanism is two-scale: the endpoint of the $i$-th axis excursion satisfies $Z_{\\rho_i}/i^{1/(1-\\alpha)}\\to c_1$ in probability, while the number $N_n$ of axis excursions before time $n$ has the same $\\sqrt{n}$ scale and $1/2$-stable fluctuations as for a simple random walk on the half-plane; combining those two scales yields the two tails.","pith_inferences":["Editorial inference: the theorem is proved only for fixed $\\alpha\\in(0,1/2)$; letting $\\alpha\\to0$ and $n\\to\\infty$ simultaneously is not covered, so the crossover between this superdiffusive regime and ordinary recurrent diffusion at $\\alpha=0$ remains an open question rather than a consequence of this paper.","Editorial inference: the paper's closing remark that $\\alpha\\ge1$ gives a ballistic walk suggests a second unresolved window $1/2\\le\\alpha<1$; one plausible guess, not claimed here, is that a different fluctuation exponent or a phase transition separates it from the $\\alpha<1/2$ regime.","Editorial inference: if the coupling lemma is made fully rigorous and extended to the whole lattice $\\mathbb{Z}^2$, where the paper's simulations suggest the walk eventually chooses a quadrant, the same two-scale argument would supply full-plane tail asymptotics; the paper explicitly does not claim this extension."],"forward_implications":["For every $0<\\alpha<1/2$, no matter how small, the walk is transient: it escapes the origin with probability one in the dominant coordinate and the escape scale is $n^{1/(2(1-\\alpha))}$, larger than the diffusive $\\sqrt{n}$.","The diffusion in the cone does not retain the particle; it sets the clock. Only about $\\sqrt{n}$ axis excursions occur up to time $n$, each axis run reaches a distance of order (count)$^{1/(1-\\alpha)}$, and the product of the two gives the superdiffusive normalization.","The explicit constants give quantitative tails: for small thresholds, $\\mathbb{P}(Z_n \\le a\\,n^{1/(2(1-\\alpha))}) \\sim (8/\\sqrt{\\pi})(a/c_1)^{(1-\\alpha)/2}$, a prediction that simulations or numerical CDF estimates can check directly.","The time spent on the axes up to time $n$ is negligible compared with $n$, so the walk inside the cones still looks diffusive; the superdiffusive scale is created entirely by the rare, long axis excursions."],"supporting_citations":[{"why":"Introduces the axis-driven random walk model and supplies the half-plane local-limit estimates for exit positions on which Lemmas 3.2 and 3.3 rely.","marker":"[AD23]"},{"why":"Provides the stable-subordinator and arcsine-law results used in Proposition 2.2 and Corollary 2.3 to identify the 1/2-stable tails of the excursion count.","marker":"[Fel68]"},{"why":"Supplies the random-walk-in-a-cone estimates that underpin the claimed n^{1/2} fluctuation scale inside the cone used in the coupling lemma.","marker":"[DW15]"}],"fun_headline_variants":["Any positive axis repulsion makes 2D walk transient and superdiffusive","Minimal axis repulsion forces a 2D walk to escape faster than diffusion","A tiny axis push triggers superdiffusive escape for 2D walks","Even minimal weak force along axes makes walk transient and superdiffusive","Weak axis force is enough to make 2D walk escape faster than diffusion"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole calculation of the tail constants depends on Lemma 2.1's claim that after a short initial phase, the walk with probability tending to one never touches the other axis; the proof of that lemma is sketched rather than fully written out.","fun_headline_variants_meta":{"raw":{"variants":["Any positive axis repulsion makes 2D walk transient and superdiffusive","Minimal axis repulsion forces a 2D walk to escape faster than diffusion","A tiny axis push triggers superdiffusive escape for 2D walks","Even minimal weak force along axes makes walk transient and superdiffusive","Weak axis force is enough to make 2D walk escape faster than diffusion"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000825,"raw_usage":{"total_tokens":3616,"prompt_tokens":963,"completion_tokens":2653,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":579,"completion_tokens_details":{"reasoning_tokens":2554}},"tokens_in":579,"tokens_out":2653,"duration_ms":16622,"temperature":1.0,"reasoning_tokens":2554,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T14:56:00.370407+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the walk for a fixed small $\\alpha$, say $\\alpha=0.1$, and for large $n$ estimate $\\mathbb{P}(Z_n \\le a\\,n^{1/(2(1-\\alpha))})$ at several small $a$; if the ratio of that probability to $(8/\\sqrt{\\pi})(a/c_1)^{(1-\\alpha)/2}$ does not approach 1, or if the fraction of trajectories that visit both axes after time $n^{1-\\epsilon}$ does not tend to 1, the central claim fails.","supporting_citations":[],"review_version":1}