{"id":"0ff1ffd9-7680-4165-bead-81f7572aeb9e","arxiv_id":"2501.12866","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper derives recursive and explicit expressions for the mean increments and mean position of an elephant random walk whose memory set at time n is the first Y(n) steps, with Y(n) uniform on {1,...,n}.","lead":"This paper introduces an elephant random walk in which the walker's memory is a randomly chosen slice of its past, and derives formulas for the average step and average position. It is a technical extension that gives exact finite-time moment formulas, but it does not analyze long-run behavior.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Conditional derivation in Section 2 is not valid for F_n as defined; the explicit mean formulas are left without a sound proof route, although the unconditional recursions are repairable.","rationale":"The reader's weakest-assumption correctly identifies the conditioning in Section 2 as the main defect. My analysis sharpens it: the paper's F_n is undefined in a way that makes (2.2) invalid under either standard interpretation of 'sigma-algebra generated by a random index set'. The explicit small-n expansions in Section 3 appear consistent with the unconditional recursion, and the unconditional recursions (2.9) and (2.10) are indeed valid if one conditions on the full history G_n. Therefore the central explicit formulas may be true, but the paper's derivation of them is not sound as written. There is also a secondary notational slip: the representation X_{n+1}=alpha_n X_{beta(Y(n))} is stated with beta(n) ~ Unif{1,...,n}, whereas the subsequent calculations require beta(r) ~ Unif{1,...,r} conditional on Y(n)=r; this is fixable but should be clarified. The appropriate disposition remains CONDITIONAL: the paper needs a repaired conditional derivation or an explicit derivation of (2.9)-(2.10) from G_n before the claimed new results are fully established.","tokens_in":11520,"tokens_out":15986,"duration_ms":165779,"concrete_test":"Evaluate the n=2 case directly. Let X1=1, X2=-1, Y(2)=2, and let alpha=2p-1 for p in (0,1), p != 1/2. Compute E[X3 | F2] from the model definition, with K uniform on {1,Y(2)}: the direct value is alpha*(X1+X2)/2 = 0. Compare with equation (2.8), which gives alpha/2. If they differ, (2.8) is not the conditional expectation with respect to F_2 as defined; then re-derive the unconditional recursion (2.9) by conditioning on G_n instead, and check whether equations (3.1) and (3.3) are reproduced for n up to at least 5.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing weakness is the conditioning in Section 2. The paper defines F_n = sigma{X_k : k in M_n} with M_n = {1,...,Y(n)}, but this random-index sigma-algebra is never rigorously specified, and on every natural formalization equations (2.2) and (2.8) fail. If F_n is taken to include Y(n), then P{Y(n)=r} in (2.2) should be replaced by 1_{Y(n)=r}; averaging over the prior is invalid. If F_n is taken as the stopped sigma-algebra sigma(X_1,...,X_{Y(n)}) without Y(n), then Y(n) is generally not F_n-measurable, and more importantly the RHS of (2.8) contains unselected increments X_k for k > Y(n), so it is not F_n-measurable. Concretely, for n=2, X1=1, X2=-1, Y(2)=2, the RHS of (2.8) equals alpha(3*1 + (-1))/4 = alpha/2, while the direct conditional expectation of X3 on this F_2-atom is alpha*(1 + (-1))/2 = 0. Thus (2.8) is not a version of E(X_{n+1}|F_n), and Remark 2.1 is unsupported. Since (2.9) and (2.10) are presented as unconditional expectations of (2.8), the proof route to the central formulas (3.1) and (3.3) is invalid as written, even though the unconditional recursions can be recovered by conditioning instead on G_n = sigma(X_1,...,X_n).","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a variant of the elephant random walk in which, at each time n, the walker's memory consists of the random set M_n = {1,...,Y(n)}, where Y(n) is uniform on {1,...,n}, and the next increment is obtained by choosing K uniformly from M_n and setting X_{n+1} = +X_K with probability p and -X_K with probability 1-p. The authors derive conditional probabilities and conditional means for the increments, then use them to obtain recursions and explicit combinatorial formulas for the mean increments E(X_{n+1}) and the mean displacement E(S_{n+1}). The main explicit results are equations (3.1) and (3.3), which express the means as polynomials in alpha = 2p-1 with coefficients given by sums over the sets Phi_n^j and Theta_n^j.","tokens_in":11783,"tokens_out":8805,"duration_ms":85334,"significance":"The model is a natural time-changed variant of the elephant random walk, and the explicit mean formulas, if rigorously established, would be a useful and nontrivial contribution to the exact analysis of this class of processes. The recursions (2.9) and (2.10) are in fact correct and can be proved by conditioning on the full history G_n, and the small-n expansions in Section 3 are consistent with those recursions. The paper proposes a clean combinatorial parametrization of the mean coefficients, with explicit cardinalities in Remarks 3.1 and 3.5. However, the conditioning framework in Section 2 is mathematically incorrect as written, and the inductive step from the small-n expansions to the general formulas in Section 3 is not supplied. The central claims are therefore not currently proven, although they appear repairable.","major_comments":[{"comment":"The conditioning argument is not valid. The sigma-algebra F_n = sigma{X_k : k in M_n} with random M_n = {1,...,Y(n)} is never rigorously defined. If Y(n) is F_n-measurable, then in (2.2) one may not average over P{Y(n)=r}; the event {Y(n)=r} is already known, so P{Y(n)=r} should be replaced by 1_{Y(n)=r}. In that reading, (2.8) is not a version of E(X_{n+1}|F_n). Concretely, for n=2 on the atom {X1=1, X2=-1, Y(2)=2}, the right-hand side of (2.8) equals alpha(1 + (1-1)/2)/2 = alpha/2, whereas the direct conditional expectation is E(X3|F_2) = alpha(X1+X2)/2 = 0. If instead F_n is read as the stopped sigma-algebra without Y(n), then the right-hand side of (2.8) is actually E(X_{n+1}|G_n) with G_n = sigma(X_1,...,X_n), not E(X_{n+1}|F_n), and Remark 2.1 is false. The same flaw affects the conditional identity leading to (2.18). The unconditional recursions (2.9) and (2.10) are nevertheless correct and can be obtained directly by conditioning on G_n; the proof route in the manuscript must be rewritten accordingly.","section":"Section 2"},{"comment":"The transition from the small-n expansions to the general explicit formulas is not proved. The sentence 'Proceeding inductively' replaces an induction that must show that the right-hand sides of (3.1) and (3.3), with the recursively defined sets Phi_n^j and Theta_n^j, satisfy the recursions (2.9) and (2.10) together with the stated initial conditions. This is not automatic from the set definitions as written: the j=2 case and the families B_{n-k}^{j-1} in Section 3.1 and Lambda_{n-k}^{j-1} in Section 3.2 are not accompanied by a proof that the construction is exhaustive, disjoint, and correctly encodes the recursion. Without such an induction, (3.1) and (3.3) are verified only for n <= 4, which does not establish the claimed general formulas.","section":"Section 3"}],"minor_comments":[{"comment":"The notation for the random index is inconsistent: the walk is written as X_{n+1} = alpha_n X_{beta(Y(n))}, but later beta(n) is used as if it were uniform on {1,...,n}; the distinction between beta(n) and beta(Y(n)) should be made explicit.","section":"Section 2"},{"comment":"The displayed list of Phi_3^2 contains the malformed tuple '(1,2, )'; it should read '(1,2)'.","section":"Section 3.1"},{"comment":"Condition C1 in (3.2) uses the symbol k both for the total exponent sum and for half the number of ones after an entry equal to 2; this makes the condition difficult to parse and should be re-notated.","section":"Remark 3.2"},{"comment":"The cardinalities in Remark 3.5 are written with lowercase theta (|theta_n^j|), while the sets in the main text are denoted by uppercase Theta_n^j; the notation should be unified.","section":"Remark 3.5"}],"recommendation":"major_revision","confidential_remarks":"The central recursions (2.9) and (2.10) are correct despite the flawed conditioning in Section 2, so I do not see the error as fatal. However, the explicit formulas in Section 3 need a genuine induction proof, and the conditional framework has to be repaired before the paper can be accepted. This is a substantial revision rather than a local correction."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives a new elephant random walk variant—random memory via two independent uniform draws—and derives explicit finite-time formulas for the mean increments and mean displacement. That much is real. The model is a natural time-changed ERW, and the combinatorial sums in Section 3 are non-trivial and check out for small n. The cardinality remarks are also a nice touch. I believe the final formulas are likely correct.\n\nThe problem is the route. Section 2 defines F_n = sigma{X_k : k in M_n} with M_n = {1,...,Y(n)}. On any standard formalization, Y(n) is F_n-measurable, so you cannot average over its distribution in (2.2). The concrete n=2 counterexample from the stress-test note is decisive: take X1=1, X2=-1, Y(2)=2. On that atom, the right-hand side of (2.8) equals alpha/2, while the direct conditional expectation E(X3|F_n) is 0. So (2.8) is not a version of the conditional mean, and Remark 2.1 is unsupported. The unconditional recursions (2.9)-(2.10) are true, but they require conditioning on G_n = sigma(X_1,...,X_n), which is not what the paper does. That is a genuine proof gap, and it is load-bearing because the explicit formulas in Section 3 are derived from these recursions.\n\nA second soft spot: the explicit formulas are introduced as 'proceeding inductively' without a complete induction. Given how intricate the sets Phi and Theta are, a referee would have to fill in substantial detail. This is a fixable issue but not a trivial one.\n\nThe impact is narrow: no asymptotics, no scaling regimes, no applications beyond exact moment computations. For the ERW community, this is a modest but legitimate extension. It is not a major advance, but it is not junk.\n\nFor peer review: I would send it out. The error in Section 2 is concrete but repairable, and the final formulas appear to be worth having. I'd require a corrected conditional derivation and a fuller proof of the explicit sums. If an editor desk-rejects on impact grounds, that's defensible, but the paper deserves referee time first.","headline":"New ERW variant with plausible explicit mean formulas, but the Section 2 conditional derivation is invalid as written; the recursions are repairable and the paper deserves a referee, not a desk reject.","tokens_in":705,"tokens_out":1053,"would_cite":false,"duration_ms":40583,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K50","60G50"],"pacs":[],"model":"deepseek-v4-flash","headline":"Random-memory elephant walk has exact finite-time mean formulas.","keywords":["elephant random walk","random memory","time-changed random walk","conditional mean","mean displacement","combinatorial recursion","memory effects","finite-time mean"],"falsifier":"For $n=3$, compute $\\mathbb{E}(X_4)$ by direct enumeration over all eight initial step sequences and all triples $(Y(1),Y(2),Y(3))$ under the memory rule, and check the result against the right-hand side of (3.1) with the sets $\\Phi_3^1$, $\\Phi_3^2$, and $\\Phi_3^3$; any disagreement at a fixed $p\\in[0,1]$ would falsify the explicit mean formula.","tokens_in":11250,"feed_emoji":"🐘","tokens_out":8690,"duration_ms":84971,"temperature":0.7,"pith_summary":"This paper introduces a variant of the elephant random walk in which, before each step, the walker rolls an n-faced die and is allowed to remember only the steps up to the rolled number, then repeats or reverses a uniformly chosen remembered step. The authors establish recursive equations for the mean increment and mean position of this walk, and then solve those recursions in closed form as finite sums over explicitly described combinatorial sets. The result matters because it gives exact finite-time control of a non-Markovian walk with random memory, where the usual full-history Markovian tools do not apply, and it provides a concrete starting point for asymptotic analysis of memory effects.","feed_headline":"Random-memory elephant walk gets exact mean formulas","feed_subtitle":"A die picks how many past steps the elephant remembers; exact recursions give its mean position.","key_machinery":"The central object is the random memory set $M_n=\\{1,2,\\dots,Y(n)\\}$, with $Y(n)$ uniform on $\\{1,\\dots,n\\}$ and the selected past index $K$ uniform on $M_n$, so the one-step transition is a composition of two uniform draws. The argument's workhorse is the conditional mean identity $\\mathbb{E}(X_{n+1}|\\mathcal{F}_n)=\\frac{\\alpha}{n}\\sum_{r=1}^n \\frac{1}{r}\\sum_{k=1}^r X_k$, from which the law of iterated expectations yields the recursions for the means. The recursions are then unrolled into explicit sums indexed by the sets $\\Phi_n^j$ and $\\Theta_n^j$, whose elements are exponent vectors $(x_2,\\dots,x_n)$ with $x_i\\in\\{0,1,2\\}$, tracking how a given past step contributes through chains of remembered steps.","core_discovery":"The paper claims that for the elephant random walk with random memory, where the next step is $X_{n+1}=\\alpha_n X_{K_n}$ with $K_n\\sim \\mathrm{unif}\\{1,\\dots,Y(n)\\}$ and $Y(n)\\sim\\mathrm{unif}\\{1,\\dots,n\\}$, the mean increments satisfy the recursion $\\mathbb{E}(X_{n+1})=\\frac{\\alpha}{n}\\sum_{r=1}^n \\frac{1}{r}\\sum_{k=1}^r \\mathbb{E}(X_k)$ and the mean displacement satisfies $\\mathbb{E}(S_{n+1})=\\mathbb{E}(S_n)+\\frac{\\alpha}{n}\\sum_{r=1}^n \\frac{\\mathbb{E}(S_r)}{r}$, where $\\alpha=2p-1$. Solving these recursions gives explicit closed forms: $\\mathbb{E}(X_{n+1})=\\sum_{j=1}^n \\alpha^j \\sum_{(x_2,\\dots,x_n)\\in\\Phi_n^j} \\frac{1}{2^{x_2}3^{x_3}\\cdots n^{x_n}}$ and $\\mathbb{E}(S_{n+1})=\\sum_{j=0}^n \\alpha^j \\sum_{(x_2,\\dots,x_n)\\in\\Theta_n^j} \\frac{1}{2^{x_2}3^{x_3}\\cdots n^{x_n}}$, with the index sets defined by a recursive combinatorial construction.","pith_inferences":["Because the explicit mean formulas are unconditional, they are likely to survive a corrected conditioning step: the fragile part of the paper is the stated conditional law, not the recursions that produce the closed forms.","The same exponent-vector expansion may extend to higher moments; the structure of the second-moment recursion suggests that $\\mathbb{E}(X_mX_n)$ is a polynomial in $\\alpha$ with similar combinatorial coefficients.","A natural next question is whether the random-memory walk exhibits a diffusive-to-superdiffusive transition analogous to the standard elephant random walk; the polynomial-in-$\\alpha$ structure invites an asymptotic analysis of the growth of these polynomials."],"forward_implications":["For every time horizon $n$, both the mean increment and the mean displacement are polynomials of degree $n$ in $\\alpha=2p-1$, with coefficients given by the combinatorial sums over $\\Phi_n^j$ and $\\Theta_n^j$.","If the first step has bias $q$, both explicit formulas are multiplied by $\\beta=2q-1$, giving a clean separation of the initial bias from the memory parameter.","The cardinalities $|\\Phi_n^j|$ and $|\\Theta_n^j|$ are polynomials in $n$ of orders $2j-1$ and $2j$ respectively, so the number of terms contributing to each power of $\\alpha$ is known exactly.","The paper also derives a second-moment recursion, yielding an expression for $\\mathbb{E}(S_{n+1}^2)$ in terms of pairwise correlations $\\mathbb{E}(X_kX_q)$, which gives a route toward variance computations.","These exact finite-time formulas can serve as baselines for simulation studies of memory-restricted elephant walks and for asymptotic comparisons with the full-memory elephant random walk."],"supporting_citations":[{"why":"Introduces the standard elephant random walk whose full-history memory rule is modified here.","marker":"[14]"},{"why":"Provides the martingale and conditional-expectation framework used to derive the recursive mean relations.","marker":"[2]"},{"why":"Studies elephant random walks with restricted memory, the neighbouring setting this paper extends.","marker":"[11]"},{"why":"Treats elephant random walks with delays, another memory restriction and a source of comparison.","marker":"[12]"},{"why":"Analyzes elephant random walks with random step sizes, showing how non-full-history structure is handled.","marker":"[7]"}],"fun_headline_variants":["Elephant walk with random memory solved for means","Exact mean position for elephant with random memory","Random-memory elephant walk: exact means at last","Elephant's random memory pinpoints its mean path","When memory is random, elephant walk means are exact"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The derivation assumes that conditioning on the random collection of remembered steps does not reveal the random number of remembered steps, so that $Y(n)$ can still be averaged over; if $Y(n)$ is in fact measurable with respect to that conditioning, the stated conditional laws in (2.8) and Remark 2.1 need to be revised.","fun_headline_variants_meta":{"raw":{"variants":["Elephant walk with random memory solved for means","Exact mean position for elephant with random memory","Random-memory elephant walk: exact means at last","Elephant's random memory pinpoints its mean path","When memory is random, elephant walk means are exact"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000787,"raw_usage":{"total_tokens":3468,"prompt_tokens":936,"completion_tokens":2532,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":552,"completion_tokens_details":{"reasoning_tokens":2468}},"tokens_in":552,"tokens_out":2532,"duration_ms":17269,"temperature":1.0,"reasoning_tokens":2468,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T16:42:41.043682+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $n=3$, compute $\\mathbb{E}(X_4)$ by direct enumeration over all eight initial step sequences and all triples $(Y(1),Y(2),Y(3))$ under the memory rule, and check the result against the right-hand side of (3.1) with the sets $\\Phi_3^1$, $\\Phi_3^2$, and $\\Phi_3^3$; any disagreement at a fixed $p\\in[0,1]$ would falsify the explicit mean formula.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the standard elephant random walk whose full-history memory rule is modified here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the martingale and conditional-expectation framework used to derive the recursive mean relations."},{"cited_title":"and Stadtm¨ uller, U","cited_arxiv_id":null,"evidence_quote":"Studies elephant random walks with restricted memory, the neighbouring setting this paper extends."},{"cited_title":"and Stadtm¨ uller, U","cited_arxiv_id":null,"evidence_quote":"Treats elephant random walks with delays, another memory restriction and a source of comparison."},{"cited_title":"and Merlev` ede, F","cited_arxiv_id":null,"evidence_quote":"Analyzes elephant random walks with random step sizes, showing how non-full-history structure is handled."}],"review_version":1}