{"id":"629a7054-920c-4318-a35e-bd2c315675c6","arxiv_id":"1908.06608","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"For symmetric random walks on N-by-N hypercubic lattices starting and ending on the boundary, the mean number of steps is N and the length distribution has an approximate n^-3/2 tail.","lead":"This paper studies random walks that start and end on the boundary of square or cubic lattices, and reports that the average walk length grows with lattice size, echoing Cauchy's classical chord formula. It also reports that walk lengths are spread according to a power law instead of an exponential, though the higher-dimensional argument is heuristic.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The higher-dimensional n^-3/2 tail rests on an unproved component-independence step and ignores the exponential cutoff for n >> N^2; the paper needs a rigorous intermediate-asymptotic statement.","rationale":"The paper's mean-length result is on solid ground: the 1D gambler's-ruin solution (Eq. 1) gives linear scaling, and the numerical data support it (with a small N-1 offset that is within plotting accuracy). The load-bearing concern is exclusively the novel part: the claim that the 2D and 3D length distributions inherit the 1D n^-3/2 tail. The paper's only bridge is a component-independence heuristic that is literally false for the discrete-time walk, because at every step exactly one coordinate changes; the coordinate hitting times are not independent and the exit time is their minimum. It is possible that the heuristic can be repaired by a continuous-time embedding, and the exponent is likely correct in the intermediate regime, but the paper does not supply the argument. In addition, the finite-state nature of the model imposes an exponential cutoff at n ~ N^2, so the phrase 'for large n' is not well defined without specifying the intermediate window. This is exactly the kind of gap that a conditional verdict should flag: it does not mean the numerical observation is wrong, but it means the stated generality exceeds what is proven. The reader's weakest assumption identifies the same issue, and the proposed test -- comparing the 2D survival function with the product of marginal 1D survival functions and checking the spectral exponential tail -- would settle whether the heuristic preserves the exponent. Therefore the reader's CONDITIONAL verdict remains appropriate; no change is needed.","tokens_in":7416,"tokens_out":20733,"duration_ms":228884,"concrete_test":"Simulate the 2D symmetric walk for N = 10^3 with at least 10^8 realizations and record the survival probability S(n) = P(T > n) for 10^2 <= n <= 10^5. Independently compute the survival probability of a 1D walk on [1,N] starting at site 2 with time rescaled by the probability that the normal coordinate moves, and the survival probability of a 1D walk started uniformly on [2,N-1]. Form the ratio R(n) = S_2D(n) / (S_x(n) S_y(n)). If R(n) is bounded away from 0 and infinity over the window, the independent-component heuristic preserves the n^-3/2 tail; if R(n) grows or decays as a nontrivial power, the heuristic fails. Separately, verify from the spectral gap lambda_1 = pi^2/(2N^2) that P(n) becomes exponential for n >> N^2, confirming that the claimed power law requires the intermediate-window qualification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central novel claim is the 2D and 3D length-distribution tail P(n) ~ n^-3/2. The only argument offered is the statement after Eq. (2): 'On a d-dimensional hypercubic lattice we may consider components of the walk along each dimension independently and so the qualitative features of the composite walk are the same as for each component.' This is not a proof. In discrete time the coordinate processes are not independent: each step changes exactly one coordinate, so the coordinate hitting times tau_x, tau_y, tau_z are dependent, and the exit time is their minimum. It is not shown that this dependence preserves the n^-3/2 tail. Moreover, for fixed N the chain has a finite state space, so the exact tail as n -> infinity is exponential, P(n) ~ C exp(-lambda n / N^2); the power law can hold only in the intermediate window 1 << n << N^2. The paper states 'for large n' without specifying this window, making the claim literally false if read as fixed-N asymptotics. Because the 2D and 3D power-law is the paper's novel contribution, this gap is load-bearing: if the component-independence heuristic is wrong, the exponent would change, and if the window is not stated, the generality claimed is unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies nearest-neighbor random walks on d-dimensional hypercubic lattices (d = 1, 2, 3) that start on the boundary and terminate upon first return to the boundary. It reports two main claims: (i) the mean walk length <n> is proportional to N, with <n> = N for symmetric walks; and (ii) the length distribution P(n) decays as n^{-3/2} for large n for symmetric walks and for some asymmetric cases. These claims are presented as a lattice analogue of Cauchy's chord-length formula. The one-dimensional case is treated with classical gambler's-ruin formulas (Eqs. (1)-(2)); the higher-dimensional results are supported by simulations with N up to 10^3 and by a heuristic component-independence argument.","tokens_in":7635,"tokens_out":19754,"duration_ms":202628,"significance":"If the n^{-3/2} tail in d = 2, 3 were rigorously established, the paper would give a simple and appealing discrete counterpart of recent continuum results on Cauchy's formula, with potential applications in first-passage and transport problems. The simulations are extensive (more than 10^6 realizations for N = 10^3), and the one-dimensional exact formulas are a useful starting point. However, the higher-dimensional distributional claim is the principal novelty and is currently supported only by an unproved heuristic; the manuscript also overstates the mean-length claim. The significance is therefore conditional on a rigorous or clearly delimited version of the distributional result.","major_comments":[{"comment":"The step 'On a d-dimensional hypercubic lattice we may consider components of the walk along each dimension independently' is not a proof. In discrete time the coordinate processes are dependent, because each step changes exactly one coordinate, and the exit time is the minimum of the dependent coordinate hitting times. No error estimate or argument is given to show that this dependence preserves the one-dimensional n^{-3/2} tail in d = 2, 3. Since this tail is the paper's novel claim, the manuscript should either supply a rigorous intermediate-asymptotic derivation or explicitly present it as a conjecture supported by simulation.","section":"Text following Eq. (2)"},{"comment":"The statement that P(n) scales as n^{-1.5} 'for large n' is ambiguous and, as a fixed-N asymptotic statement, false. Equation (2) contains factors cos^{n-1}(nu pi / N), so for fixed N and n >> N^2 the distribution decays exponentially, not as a power law. The power law can hold only in the intermediate window 1 << n << N^2. The paper should state this window explicitly and verify that the data in Figs. 3 and 4 are collected within it; without that qualification, the claim is literally incorrect as a fixed-N asymptotic statement.","section":"Abstract and Fig. 3 discussion"},{"comment":"The abstract and the concluding paragraph claim without qualification that 'the mean length of walks is equal to N'. The body shows this is not true for the anisotropic cases: the two two-dimensional asymmetric datasets are multiplied by fitted factors 0.89 and 1.20 to collapse onto the <n> = N line, and in one dimension the asymmetric formula (1) gives proportionality constants that depend on the bias and the starting distribution. The abstract should carry the same caveat as the body: <n> is proportional to N, with <n> = N only for symmetric walks in the large-N limit and under the specified boundary-entry convention.","section":"Abstract and conclusion"},{"comment":"Equation (1) contains an off-by-one error. For a simple symmetric random walk on sites 1, ..., N with absorbing endpoints 1 and N, the expected duration from site m is (m-1)(N-m), not m(N-m); for N = 3 and m = 2, the formula gives S_2 = 2 while the true value is 1. This error propagates into the claimed proportionality constants and into the empirical 0.89 and 1.20 rescaling factors used in Fig. 2, so Eq. (1) and the statements depending on it must be corrected before the quantitative claims can be accepted.","section":"Eq. (1)"}],"minor_comments":[{"comment":"There are several typographical errors: 'leng th' in the title, 'Shil long' for Shillong, and 'Euvres' should be 'Oeuvres' in the first reference.","section":"Title and affiliations"},{"comment":"The caption refers to 'open black squares', but the legend lists line styles and colors; please clarify which dataset corresponds to the non-power-law case.","section":"Fig. 3 caption"},{"comment":"The text says 'The simulation data agrees with the analytic solution mentioned above but the peak is a finite size effect', yet earlier it says the analytic result applies to n <= N while the peak occurs at n about 2N. This needs clarification of which regimes are covered by the analytic formula.","section":"Fig. 4 discussion"},{"comment":"The rendering of Eq. (2) is ambiguous: '2np' should presumably read '2^n p' or similar. Please correct the typography so the factors are unambiguous.","section":"Eq. (2)"}],"recommendation":"major_revision","confidential_remarks":"The paper is a short letter-style manuscript whose central novelty is the power-law tail in d >= 2. That claim is not proven, and the off-by-one error in Eq. (1) undermines the quantitative mean-length statements. I recommend major revision; if the authors cannot supply a proof of the higher-dimensional tail, they should reframe the paper as a numerical study with explicit conjecture status."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nThe paper's 1D analytic core is classical (Ellis/Feller), and for symmetric surface-to-surface walks on hypercubic lattices the mean-length result <n>=N is well supported by analytics and simulations. That part is a clean, if modest, lattice rendering of Cauchy's formula, and the paper gives proper credit to the continuum work in refs [7,8]. What is genuinely new is the claim that the walk-length distribution in d=2,3 decays as n^{-3/2}, and that is where the paper gets soft.\n\nThe component-independence step after Eq. (2) is an assertion, not a proof. In discrete time, each step changes exactly one coordinate, so the coordinate hitting times are dependent; the exit time is the minimum of those hitting times. Nothing in the paper shows the dependence preserves the one-dimensional tail. On top of that, for fixed N the state space is finite, so the exact tail is exponential for n >> N^2; the power-law can only hold in an intermediate window. The paper says \"for large n\" without specifying this, which is at best misleading. The abstract also states \"mean length is equal to N\" without the symmetric-walk caveat, though the body is more careful. The weighting factors 0.89 and 1.20 used to collapse the asymmetric data are fitted, not derived—a minor point compared to the tail gap.\n\nThese gaps are addressable. The authors should state a precise intermediate-asymptotic result and either derive the d=2,3 tail or provide a controlled approximation. As it stands, the paper is a physically motivated heuristic with clean simulations and a solid 1D anchor, not a rigorous theorem. It deserves referee time—a serious referee could push the authors to make the window explicit and test the component-independence assumption directly—but the decision should be conditional on that revision.\n\nFor a reader, it is a useful note if you care about lattice first-passage or stereology. I would put it in the \"maybe\" pile for a reading group, and I would not cite the tail claim in its current form. I would accept it for peer review, with the expectation of major revisions.\n\nBest","headline":"A clean lattice version of Cauchy's mean chord formula with a heuristic—not proven—power-law tail in 2D/3D.","tokens_in":8203,"tokens_out":3630,"would_cite":false,"duration_ms":37893,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A random walk from boundary to boundary of an $N^d$ hypercubic lattice has mean length $N$ and a $n^{-3/2}$ power-law tail.","keywords":["Cauchy's formula","mean chord length","random walk","hypercubic lattice","gambler's ruin","power-law distribution","first-return time","first-passage"],"falsifier":"Compute the exact first-return-time distribution of the isotropic two-dimensional walk to the square boundary by transfer-matrix or eigenvalue methods, or by very high-statistics simulation at $N=10^4$, and measure the log-log slope in the window $N \\ll n \\ll N^2$; a slope clearly different from $-3/2$, or a slope that shifts with $N$, would refute the central claim. A direct check of the component-independence assumption is to measure whether the tail distribution depends on the exit coordinate along one axis: if it does, the reduction to independent components fails.","tokens_in":7149,"feed_emoji":"🎲","tokens_out":9215,"duration_ms":84643,"temperature":0.7,"pith_summary":"This paper establishes a lattice analogue of Cauchy's mean-chord formula: a random walk on an $N \\times N$ square or $N \\times N \\times N$ cubic lattice that starts at a uniformly chosen boundary site and stops at its first return to the boundary has mean length $\\langle n \\rangle = N$, the volume-to-surface ratio in lattice units. The same linear scaling holds for certain anisotropic walks after fixed rescaling. The paper also reports that for symmetric walks the distribution of lengths decays as $P(n) \\sim n^{-3/2}$ for large $n$, a power law rather than the exponential distribution of continuum mean-field treatments. This matters because it shows that the mean chord length depends only on $V/S$ and not on the detailed zig-zag path inside the body, and it offers a simple explanation of Cauchy's formula through the one-dimensional gambler's ruin problem.","feed_headline":"Mean surface-to-surface walk length equals N on a hypercube","feed_subtitle":"The old volume-to-surface chord formula survives even when chords become lattice random walks.","key_machinery":"The mechanism is the projection of the lattice walk onto one coordinate axis, which is a one-dimensional random walk between two absorbing endpoints, the gambler's ruin problem. The exact solution gives the mean absorption time $m(N-m)$ from site $m$, hence $N$ for a boundary-to-boundary walk, and a hitting-time distribution decaying as $n^{-3/2}$. The paper's argument then treats the $d$-dimensional walk as a set of independent such components along each axis, so the linear mean and the qualitative power-law tail transfer from one dimension to two and three dimensions; the same one-dimensional formula explains the anisotropic cases, including the weight factors that collapse the mean-length data.","core_discovery":"The central discovery is that Cauchy's formula survives when straight chords are replaced by restricted lattice random walks: an isotropic walk that enters an $N^d$ hypercubic lattice through a uniformly chosen surface site and leaves at the first surface hit has mean length equal to $N$, independently of $d$ in the dimensions studied. The distribution of walk lengths is qualitatively different from the continuum mean-field exponential: it decays as $C n^{-3/2}$ over many decades for a symmetric walk. For anisotropic walks the mean still scales linearly with $N$ after multiplying by fixed weight factors, and the power-law tail persists precisely when the walk is symmetric between each pair of opposite faces; breaking that symmetry replaces the tail with a finite-size peak. The paper argues that all of these features reduce to the one-dimensional two-absorber random walk.","pith_inferences":["Editorial inference: the component-independence assumption suggests a testable factorization of the $d$-dimensional first-return-time distribution into one-dimensional factors in the window $N \\ll n \\ll N^2$; measuring correlations between exit times and exit coordinates would confirm or refute it.","Editorial inference: for rectangular or other non-cubic domains, the mean walk length should still scale with the volume-to-surface ratio, but the tail exponent and the location of the finite-size cutoff may depend on aspect ratio.","Editorial inference: the loopy, localized structure of surface-to-surface walks resembles a bounded-domain model of anomalous diffusion, where the power-law tail could be observed as a slowly decaying return-time distribution in single-particle-tracking experiments."],"forward_implications":["If the main claim is correct, the mean first-return length on an $N^d$ hypercubic lattice is $N$ for every dimension studied, so the volume-to-surface ratio controls the mean even when a single step does not resemble a chord.","The $n^{-3/2}$ tail implies that long walks are abundant: the probability of a walk lasting $n$ steps decays only polynomially, so fluctuations around the mean are much larger than an exponential model would allow.","The lattice derivation ties Cauchy's formula to the gambler's ruin problem, giving a simple route to the chord-length formula that does not require the Boltzmann transport equation.","When the walk is symmetric between opposite faces, the power-law tail holds; when that symmetry is broken, the same mean scaling survives but the power-law tail is replaced by a finite-size peak."],"supporting_citations":[{"why":"Supplies the canonical gambler's ruin solution used for the one-dimensional mean and hitting-time distribution.","marker":"[10]"},{"why":"Together with [10], provides the analytic one-dimensional absorption formulas that underlie the paper's derivation.","marker":"[9]"},{"why":"Gives the continuum Cauchy formula and the two validity conditions, uniform starting position and isotropic incident flux, that the lattice setup is designed to reproduce.","marker":"[8]"},{"why":"Provides the continuum path-integral prediction (mean length proportional to radius for isotropic walks) that the lattice power-law result is contrasted with.","marker":"[7]"}],"fun_headline_variants":["Cauchy's chord law holds for isotropic hypercube walks","Mean walk length equals N on hypercubes: Cauchy's formula extends","Isotropic random walks obey Cauchy's mean chord law: length N","Cauchy's chord formula works for lattice random walks","Cauchy's formula survives when chords become random walks"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the components of the walk along the coordinate axes are independent, so the one-dimensional $n^{-3/2}$ tail transfers unchanged to two and three dimensions, and that 'large $n$' means the intermediate window $N \\ll n \\ll N^2$ before the one-dimensional finite-size exponential cutoff sets in.","fun_headline_variants_meta":{"raw":{"variants":["Cauchy's chord law holds for isotropic hypercube walks","Mean walk length equals N on hypercubes: Cauchy's formula extends","Isotropic random walks obey Cauchy's mean chord law: length N","Cauchy's chord formula works for lattice random walks","Cauchy's formula survives when chords become random walks"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000999,"raw_usage":{"total_tokens":4183,"prompt_tokens":856,"completion_tokens":3327,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":472,"completion_tokens_details":{"reasoning_tokens":3243}},"tokens_in":472,"tokens_out":3327,"duration_ms":24828,"temperature":1.0,"reasoning_tokens":3243,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:39:21.586929+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the exact first-return-time distribution of the isotropic two-dimensional walk to the square boundary by transfer-matrix or eigenvalue methods, or by very high-statistics simulation at $N=10^4$, and measure the log-log slope in the window $N \\ll n \\ll N^2$; a slope clearly different from $-3/2$, or a slope that shifts with $N$, would refute the central claim. A direct check of the component-independence assumption is to measure whether the tail distribution depends on the exit coordinate along one axis: if it does, the reduction to independent components fails.","supporting_citations":[{"cited_title":"Feller An Introduction to Probability Theory and Its Implications , vol","cited_arxiv_id":null,"evidence_quote":"Supplies the canonical gambler's ruin solution used for the one-dimensional mean and hitting-time distribution."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Together with [10], provides the analytic one-dimensional absorption formulas that underlie the paper's derivation."},{"cited_title":"Mazzolo, A","cited_arxiv_id":null,"evidence_quote":"Gives the continuum Cauchy formula and the two validity conditions, uniform starting position and isotropic incident flux, that the lattice setup is designed to reproduce."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the continuum path-integral prediction (mean length proportional to radius for isotropic walks) that the lattice power-law result is contrasted with."}],"review_version":1}