{"id":"6ed1603a-6893-40eb-b964-a3e3e78eccbd","arxiv_id":"1908.06611","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For any transient random walk on Z^d, the normalized spatial sum of any modestly growing function of local times converges almost surely to an explicit constant in terms of the escape probability.","lead":"This paper proves a strong law of large numbers for spatial sums of functions of the local times of a transient random walk in any dimension. It gives one theorem that covers the number of visited sites, alpha-fold self-intersections, and sites visited exactly j times.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 omits the necessary hypothesis f(0)=0; as stated, G_n(f) is infinite for any f with f(0)≠0.","rationale":"The reader's ACCEPT verdict is largely justified: the proof of Theorem 1 is internally consistent for functions with f(0)=0 and satisfying (3), and the result unifies known SLLNs. However, the theorem statement as written omits the necessary condition f(0)=0, without which G_n(f) is infinite for any f with f(0)≠0. This is a concrete gap in the central claim's formulation, not merely a stylistic point: the theorem's quantification over all f:Z_+→R with (3) is false as stated. The fix is trivial and does not affect the advertised corollaries, but the paper should be revised to add f(0)=0 to Theorem 1. No other load-bearing mathematical flaw was identified; the variance and almost-sure arguments appear sound for the corrected statement.","tokens_in":13142,"tokens_out":49766,"duration_ms":429086,"concrete_test":"Take any transient random walk in Z^d and set f(0)=1, f(j)=0 for all j≥1. Then condition (3) holds vacuously. Compute G_n(f)=∑_{x∈Z^d} f(l(n,x))=∑_{x:l(n,x)=0}1=∞, since infinitely many sites are never visited by time n. The claimed convergence to γ^2∑_{j≥1}f(j)(1−γ)^{j−1}=0 is therefore undefined. This single counterexample shows that Theorem 1 must include the hypothesis f(0)=0.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorem 1 states that for any f:Z_+→R satisfying (3), G_n(f)/n converges to γ^2∑_{j≥1}f(j)(1−γ)^{j−1}. But G_n(f)=∑_{x∈Z^d}f(l(n,x)); for all but O(n) sites, l(n,x)=0, so if f(0)≠0 the sum over the infinitely many unvisited sites contributes an infinite constant, making G_n(f)=∞ for every n and the quotient undefined. The proof begins 'Without loss of generality we assume f(0)=0', but this is not a lossless reduction: f(0)=0 is a necessary condition for the object G_n(f) to be finite. All intended examples (range, α-fold self-intersections, sites visited exactly j times) indeed have f(0)=0, so the main content is unaffected, but the theorem as written quantifies over functions for which the conclusion is meaningless. The statement should explicitly include f(0)=0.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves a strong law of large numbers for the spatial sum G_n(f) = \\sum_{x\\in\\mathbb Z^d} f(l(n,x)) of a function f of the local times of a transient random walk in \\mathbb Z^d. Theorem 1 states that if \\sum_{j\\ge 1} f^2(j) j (1-\\gamma)^j < \\infty, then G_n(f)/n converges to \\gamma^2 \\sum_{j\\ge 1} f(j)(1-\\gamma)^{j-1} in mean square and almost surely, where \\gamma is the escape probability. This unifies earlier results for the range, for \\alpha-fold self-intersections, and for the number of sites visited exactly j times. The proof proceeds by a renewal decomposition for the expectation (Lemma 5), a variance bound for nondecreasing f with f(0)=0 (Lemma 6), and a subsequence Borel-Cantelli argument for the almost sure convergence. The paper also identifies and fixes gaps in earlier arguments by Becker-K\\\"onig and by Erd\\H{o}s-Taylor, and proves a stronger result, Theorem 4, under weaker growth conditions at the cost of extra technical assumptions on the return probabilities.","tokens_in":13328,"tokens_out":12934,"duration_ms":125530,"significance":"If the missing hypothesis f(0)=0 is added, the main result is a clean, parameter-free limit constant derived from first principles through the renewal equation, with no fitted parameters and no normalization chosen after the fact. The theorem genuinely unifies the range, self-intersection counts, and exact-visit-count statistics for arbitrary transient random walks, and it removes the extra moment conditions needed in earlier treatments for d=1,2. The proof is self-contained and transparent: the variance lemma is of independent interest, and the paper explicitly flags and repairs gaps in prior literature, such as the Tauberian argument in Becker-K\\\"onig and the maximal-local-time upper bound in Erd\\H{o}s-Taylor. The conjectured normalizations for faster-growing f are also a useful contribution to the topic.","major_comments":[{"comment":"Theorems 1 and 4 must include the explicit hypothesis f(0)=0. As stated, for any f with f(0)\\neq 0, the quantity G_n(f)=\\sum_{x\\in\\mathbb Z^d} f(l(n,x)) is infinite for every n, because only O(n) sites are visited up to time n while the remaining infinitely many sites contribute the constant f(0) to the sum; the quotient G_n(f)/n is then undefined. The opening of the proof of Theorem 1, 'Without loss of generality we assume f(0)=0,' is therefore not a lossless reduction but the installation of a necessary condition. The intended examples (range, \\alpha-fold self-intersections, exactly-j visits) all have f(0)=0, and Lemma 6 already assumes f(0)=0, so adding this hypothesis to Theorems 1 and 4, and to the decomposition in (20), is a local correction that does not affect the substance of the proofs.","section":"Theorem 1 (Section 1) and Theorem 4 (Section 5)"}],"minor_comments":[{"comment":"The phrase 'subexponential functions f(i) of order e^{o(i)}' is informal; condition (3) is a precise growth condition, so the text should say 'functions growing like e^{o(i)}' to avoid confusion with subexponential distributions in probability.","section":"Section 1"},{"comment":"Lemma 5 does not explicitly state the transience assumption, although the proof uses \\gamma_n\\to\\gamma and the limit is expressed in terms of \\gamma; adding 'for a transient random walk' would improve clarity.","section":"Section 2, Lemma 5"},{"comment":"The wording 'for all n \\geq N where N is finite with probability 1' should be rephrased as 'there exists a random finite N such that the inequality holds for all n\\geq N, almost surely.'","section":"Section 5, Proposition 8"},{"comment":"There is a typo in the introduction: 'Bec ker' should be 'Becker.'","section":"Section 1"}],"recommendation":"minor_revision","confidential_remarks":"The only substantive issue is the missing f(0)=0 hypothesis in Theorems 1 and 4; it is a one-line correction and the proofs already work under that condition, so I recommend minor revision rather than major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper does something real: it proves a single strong law of large numbers for G_n(f) = sum_x f(l(n,x)) over arbitrary transient random walks in any dimension, under a clean growth condition on f. That unifies the range, alpha-fold self-intersections, and exactly-j visits, and it removes the extra moment assumptions that earlier work needed in d=1,2. The proof also fixes a genuine gap in Becker–Koenig by avoiding a Tauberian argument that required the sequence EQ_n(j) to be ultimately increasing; the renewal-decomposition plus dominated-convergence route in Lemma 5 is clear and self-contained. Lemma 6's variance bound works for any non-decreasing f with f(0)=0, which is more general than the power-function-only bound in the literature. The almost-sure argument via the subsequence trick is standard but correctly executed. This is a solid piece of random walk theory.\n\nThe main flaw is in the statement of Theorem 1: it omits the necessary hypothesis f(0)=0. As written, G_n(f) sums f(0) over every unvisited site, and there are infinitely many of those, so G_n(f) is infinite for every n whenever f(0) is nonzero. The proof's 'Without loss of generality we assume f(0)=0' is not a lossless reduction; it is a necessary condition for the object to be finite. All the intended applications have f(0)=0, so the content of the paper is unaffected, and adding f(0)=0 to the theorem statement is a one-line fix. Still, as stated, the theorem quantifies over functions for which the conclusion is meaningless. That should be caught in revision.\n\nTwo other soft spots, both minor. First, condition (3) restricts f to subexponential or mildly exponential growth, and the paper itself notes this and proves Theorem 4 for faster growth under extra assumptions on return probabilities and a stronger tail condition on f. That is fine, but the boundary is a bit ad hoc. Second, the conjectured normalizations for f growing like (1-gamma)^{-k} are clearly labeled as conjectures, so there is no overclaiming, but they also point to where the theory is unfinished. The citation pattern looks honest: prior work is credited, the gap in Becker–Koenig is explicitly located, and the fixes are real.\n\nWho is this for? People working on random walk local times, range statistics, or self-intersections of transient walks. The new theorem is worth knowing, and the proof technique for the variance is reusable. It deserves a serious referee; the mathematical core is sound, and the one required correction is purely cosmetic in content but necessary in statement. I would send it to review and ask for the f(0)=0 hypothesis to be added.","headline":"A genuinely useful unification of SLLNs for functionals of local times, with one missing hypothesis in the main theorem statement that is trivial to fix.","tokens_in":13852,"tokens_out":1850,"would_cite":true,"duration_ms":20541,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60G50","60J55","60F15"],"pacs":[],"model":"deepseek-v4-flash","headline":"A unified strong law of large numbers for local-time sums of transient random walks.","keywords":["transient random walk","local times","strong law of large numbers","range of random walk","self-intersections","sites visited exactly j times","escape probability"],"falsifier":"Take a walk with $\\gamma\\in(0,1)$ and set $f(k)=c/(1-\\gamma)^k$, which violates condition (3). The paper conjectures $G_n(f)/n^2\\to c'$ for $d\\ge 5$, $G_n(f)/n^{3/2}\\to c'$ for $d=3$, and $G_n(f)\\log n/n^2\\to c'$ for $d=4$. A simulation or rigorous bound showing $G_n(f)/n$ stays bounded, or diverges at a different rate, would falsify that conjecture.","tokens_in":12963,"feed_emoji":"🎲","tokens_out":5988,"duration_ms":51543,"temperature":0.7,"pith_summary":"A transient random walk on $\\mathbb Z^d$ leaves a footprint of local times $l(n,x)$, and the paper proves that for any function $f$ growing not faster than about $\\exp((1/2)\\lambda^* k)$ with $\\lambda^*=\\log(1/(1-\\gamma))$, the spatial sum $G_n(f)=\\sum_{x\\in\\mathbb Z^d} f(l(n,x))$ obeys $G_n(f)/n\\to \\gamma^2\\sum_{j\\ge 1} f(j)(1-\\gamma)^{j-1}$ almost surely and in mean square. Because $f$ is arbitrary, this one theorem supplies strong laws for the number of distinct sites visited, for $\\alpha$-fold self-intersections, and for the number of sites visited exactly $j$ times, unifying results that were previously proved case by case. The condition on $f$ is a growth bound that makes the limiting series absolutely convergent; the paper also shows that with stronger tail assumptions on return probabilities the law can hold for $f$ growing like $e^{\\lambda^* k}$ up to polynomial corrections. A sympathetic reader should see this as a definitive linear law for additive local-time statistics: the spatial average of any tame function of local time stabilises at a constant determined solely by the escape probability.","feed_headline":"One limit law unifies range and self-intersection counts","feed_subtitle":"For transient walks, spatial sums of f(local time) converge almost surely to a constant series in the escape probability.","key_machinery":"The central representation is $G_n(f)=\\sum_{j=1}^n f(j)Q_n(j)$, where $Q_n(j)$ is the number of sites visited exactly $j$ times. Its expectation is a renewal sum: $EQ_n(j)=\\sum_{n_0+\\cdots+n_j=n}\\gamma_{n_0}\\,\\prod_{i=1}^{j-1}P\\{\\tau=n_i\\}\\,\\gamma_{n_j}$, with $\\gamma_n=P\\{$no return by step $n\\}$ and $\\tau$ the first return time. Since $\\gamma_n$ converges to the escape probability $\\gamma$, dominated convergence gives $EQ_n(j)/n\\to \\gamma^2(1-\\gamma)^{j-1}$. The variance is controlled by decomposing a general $f$ into non-decreasing parts, writing the covariance as a signed sum over tail events, and bounding the probability of alternating visits $x$-$y$-$x$ by $(1-\\gamma)^{i-1}\\sum_{r=1}^n r(n-r)P\\{S_r=0\\}$; transience makes this sum $o(n^2)$.","core_discovery":"Theorem 1 states: if $(S_n)$ is transient with escape probability $\\gamma\\in(0,1)$, and $f:\\mathbb Z_+\\to\\mathbb R$ satisfies $\\sum_{j\\ge 1} f^2(j)\\, j\\,(1-\\gamma)^j<\\infty$, then $G_n(f)/n$ converges to $\\gamma^2\\sum_{j\\ge 1} f(j)(1-\\gamma)^{j-1}$ as $n\\to\\infty$, both in mean square and with probability $1$. The proof splits into an expectation asymptotics (Lemma 5), valid under the weaker condition $\\sum |f(j)|(1-\\gamma)^j<\\infty$, and a variance bound (Lemma 6) that shows $\\operatorname{Var} G_n(f)=o(n^2)$ under the squared condition; a subsequence argument (Lemma 7) upgrades $L^2$ convergence to almost sure convergence using only transience ($\\sum_n P\\{S_n=0\\}<\\infty$). The theorem applies to any transient walk in any dimension $d\\ge 1$, with no moment or lattice assumptions.","pith_inferences":["The paper's conjectured normalisations for $f(k)\\sim c/(1-\\gamma)^k$ ($n^2$ in $d\\ge 5$, $n^{3/2}$ in $d=3$, $n^2/\\log n$ in $d=4$) suggest a phase transition: above the $e^{\\lambda^* k/2}$ threshold, a small number of very heavily visited sites dominates $G_n(f)$, so the linear law breaks. Testing this numerically for a specific walk would clarify the boundary of Theorem 1.","The variance-bound method, which avoids Tauberian theorems and monotonicity of $EQ_n(j)$, might extend to additive functionals of other Markov chains with a renewal structure, giving a general law of large numbers for occupation statistics.","Applying the theorem to linear combinations of functions gives a multidimensional SLLN for local-time statistics: the vector $(G_n(f_1)/n,\\dots,G_n(f_m)/n)$ converges almost surely to the corresponding deterministic limit vector.","The almost-sure part is proved by a subsequence trick that only needs $\\sum_n a_n/n<\\infty$; the sharpness of that condition, or a law of the iterated logarithm for $G_n(f)$, is left open."],"forward_implications":["Corollary 2: for every $\\alpha\\ge 0$, the number of $\\alpha$-fold self-intersections $L_n(\\alpha)$ satisfies $L_n(\\alpha)/n\\to \\gamma^2\\sum_{j\\ge 1} j^\\alpha(1-\\gamma)^{j-1}$ almost surely and in $L^2$.","Corollary 3: for any set $J\\subseteq\\mathbb N$, the proportion of sites whose local time falls in $J$ converges almost surely to $\\gamma^2\\sum_{j\\in J}(1-\\gamma)^{j-1}$, generalising the Erdős–Taylor and Pitt theorems to arbitrary transient walks.","The growth condition (3) is satisfied by all subexponential $f$ and by exponentials up to order $e^{ck}$ with $c<\\lambda^*/2$, so the result covers power functions of every degree.","Under return-probability tail conditions, Theorem 4 shows the SLLN persists for $f$ growing like $e^{\\lambda^* k}/k^{2+\\varepsilon}$ or $e^{\\lambda^* k}/(k\\log^{2+\\varepsilon} k)$.","For recurrent walks the normalisation $n$ fails (e.g., $n/\\log n$ in two dimensions), so the transient setting is exactly where the linear law holds."],"supporting_citations":[{"why":"Dvoretzky and Erdős supply the $\\gamma_n$ notation, the renewal representation of $EQ_n(j)$, and the original range SLLN that the paper generalises.","marker":"[8]"},{"why":"Becker and König studied $\\alpha$-fold self-intersections and their variance, providing the framework and the gap that the present proof fixes.","marker":"[1]"},{"why":"Erdős and Taylor proved the strong law for sites visited exactly $j$ times for simple random walks and gave the maximal local time bound used in Theorem 4.","marker":"[4]"},{"why":"Pitt proved the singleton case for transient random walks on countable Abelian groups by induction, which Corollary 3 generalises to arbitrary $J$.","marker":"[13]"},{"why":"Spitzer gave the range convergence in probability that Corollary 2 upgrades to almost sure convergence.","marker":"[12]"},{"why":"Doney and Korshunov provide the first-return time asymptotics $P\\{\\tilde\\tau=n\\}\\sim c/n^{d/2}$ used in the conjectured normalisations for functions that violate the growth condition.","marker":"[7]"}],"fun_headline_variants":["Transient walk local-time sums converge almost surely","One SLLN unifies range, self-intersections, and visit counts","Escape probability dictates local-time sum limit","Local-time spatial sums: a unified almost sure limit","From visited sites to self-intersections, one law"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The claim depends on the growth condition $\\sum_{j\\ge 1} f^2(j)\\,j\\,(1-\\gamma)^j<\\infty$; if $f$ grows faster, the linear normalisation $n$ may fail and the stated limit may diverge, so the theorem applies only to functions growing at most exponentially with exponent below $\\lambda^*/2$.","fun_headline_variants_meta":{"raw":{"variants":["Transient walk local-time sums converge almost surely","One SLLN unifies range, self-intersections, and visit counts","Escape probability dictates local-time sum limit","Local-time spatial sums: a unified almost sure limit","From visited sites to self-intersections, one law"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000563,"raw_usage":{"total_tokens":2687,"prompt_tokens":979,"completion_tokens":1708,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":595,"completion_tokens_details":{"reasoning_tokens":1628}},"tokens_in":595,"tokens_out":1708,"duration_ms":11249,"temperature":1.0,"reasoning_tokens":1628,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:39:27.581561+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a walk with $\\gamma\\in(0,1)$ and set $f(k)=c/(1-\\gamma)^k$, which violates condition (3). The paper conjectures $G_n(f)/n^2\\to c'$ for $d\\ge 5$, $G_n(f)/n^{3/2}\\to c'$ for $d=3$, and $G_n(f)\\log n/n^2\\to c'$ for $d=4$. A simulation or rigorous bound showing $G_n(f)/n$ stays bounded, or diverges at a different rate, would falsify that conjecture.","supporting_citations":[{"cited_title":"In: Proc","cited_arxiv_id":null,"evidence_quote":"Dvoretzky and Erdős supply the $\\gamma_n$ notation, the renewal representation of $EQ_n(j)$, and the original range SLLN that the paper generalises."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Becker and König studied $\\alpha$-fold self-intersections and their variance, providing the framework and the gap that the present proof fixes."},{"cited_title":"Acta Math","cited_arxiv_id":null,"evidence_quote":"Erdős and Taylor proved the strong law for sites visited exactly $j$ times for simple random walks and gave the maximal local time bound used in Theorem 4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Pitt proved the singleton case for transient random walks on countable Abelian groups by induction, which Corollary 3 generalises to arbitrary $J$."},{"cited_title":"V an Nostrand, Princeton (1964)","cited_arxiv_id":null,"evidence_quote":"Spitzer gave the range convergence in probability that Corollary 2 upgrades to almost sure convergence."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Doney and Korshunov provide the first-return time asymptotics $P\\{\\tilde\\tau=n\\}\\sim c/n^{d/2}$ used in the conjectured normalisations for functions that violate the growth condition."}],"review_version":1}