Pith. sign in

REVIEW 3 major objections 5 minor 24 references

This paper derives the exact long-time exponential growth rate of the Laplace transform of the Elephant Random Walk for every memory parameter in [-1,1], using a Schwarz–Christoffel mapping to control the generating function's singularities

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-02 00:03 UTC pith:6DWFTJEU

load-bearing objection The a<0 half of Theorem 1 is a genuinely new and mostly sound singularity-analysis result; the a>0 half is invalid as written because Proposition 4 carries the wrong sign in the composition, which puts the dominant singularity on the negative real axis and contradicts the recurrence already at L_2. the 3 major comments →

arxiv 2607.15125 v1 pith:6DWFTJEU submitted 2026-07-16 math.PR

Asymptotics for the Laplace transform of the Elephant Random Walk via Schwarz-Christoffel mappings

Juan Esaul Gonz\'alez Rangel This is my paper
classification math.PR MSC 60F1060G5030C30
keywords Elephant Random WalkLaplace transform asymptoticsSchwarz–Christoffel mappingsingularity analysislarge deviationsgenerating functionanalytic continuationmemory parameter
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that the Laplace transform of the Elephant Random Walk grows exponentially at a rate φ(a;x) that depends only on the memory parameter a and the argument x, not on the first-step bias q. The result covers all a∈[-1,1] and gives explicit prefactors in the three regimes a<0, a=0, a>0, the last depending on q and the sign of x. From this one deduces the known large-deviation principle and characterizes exactly how smooth the rate function is at zero. The proof works by solving a transport PDE for the generating function, expressing its solution through the inverse of a Schwarz–Christoffel integral, and applying singularity analysis.

Core claim

Theorem 1 states that as n→∞, L_n(a;x) = (φ(a;x))^n(1+o(1)) for a∈[-1,0), L_n(a;x) = 2[(1-q)/(e^{-2x}+1)+q/(e^{2x}+1)](cosh x)^n(1+o(1)) for a=0, and L_n(a;x) = 2[(1-q)/(a+1) 1_{x>0} + q/(a+1) 1_{x<0}](φ(a;x))^n(1+o(1)) for a∈(0,1], where φ(a;x) is defined by (4). The exponential rate is independent of the first-step parameter q; q enters only as a prefactor in the memory regime a>0 and vanishes in the a<0 regime. As a corollary the ERW satisfies a large-deviation principle with rate function Λ*(x)=sup_t{tx−log φ(a;t)}, matching the known LDP for equivalent urn models. The paper also proves that a↦φ(a;x) is analytic at 0 for a<0 and non-analytic for a>0, with first singular term of order |x|

What carries the argument

The central object is the generating function L_a(x,z)=Σ_{n≥0} L_{n+1}(a;x) z^n, which satisfies the transport PDE (1−z cosh x)∂_z L = a sinh x ∂_x L + cosh x L. Method of characteristics leads to L_a(x,z)=sinh^{-1/a}(x) A(k^{-1}(k(sinh x)−z sinh^{1/a}(x))), where A(t)=((1−2q)t+√(1+t²)) t^{1/a} and k(t) is a Schwarz–Christoffel-type integral (9). The whole technical effort is to prove that k^{-1} extends analytically to a domain containing a half-plane plus a circular sector around the dominant singularity, so that singular analysis can extract the coefficient asymptotics. For a∈(-1,-1/2] this extension is achieved by recognizing k as a Schwarz–Christoffel map from the upper half-plane to a

Load-bearing premise

The central claim collapses if the inverse of k does not actually extend analytically to the required domain containing the half-plane plus a sector around the singularity; the paper's proof of this extension rests on a vector-field sign analysis for a∈(-1/2,1) and on a Schwarz–Christoffel representation with finite reflections for a∈(-1,-1/2], and the latter's counting argument is asserted rather than proven in full detail.

What would settle it

For a=1/3, x=2, q=1/2, numerically evaluate the explicit formula (7) along a sector approaching the singularity z_0 = k(sinh 2) sinh^{3}(2) and verify that (z_0 - z) L_a(x,z) converges to the predicted constant 2(1-q)/(a+1) times the appropriate scale; if the limit is not the predicted constant, the singularity analysis fails.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • For every a∈[-1,1), the ERW satisfies a large-deviation principle with good rate function Λ*(x)=sup_t{tx−log φ(a;t)} (Corollary 2).
  • The exponential growth rate log φ(a;x) is independent of the first-step bias q; q modifies only the subexponential prefactor, and only for a>0.
  • The rate function φ(a;·) is C^{⌊1/a⌋−1} but not smoother at 0 for a>0; for a<0 it is analytic at 0 (Proposition 3).
  • For a=±1/n with integer n, the paper gives closed-form expressions for 1/φ(a;x) in terms of trigonometric and hyperbolic functions (Table 1).
  • L_n(q,a;−x)=L_n(1−q,a;x), so it suffices to consider x>0; the asymptotic formulas are consistent with this symmetry.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The method of solving the generating function through a transport PDE and a Schwarz–Christoffel inverse may transfer to other reinforced walks or urn models whose transition probabilities depend linearly on the current state, where similar PDEs are known to appear.
  • The sharp threshold in regularity of φ at a=1/2 suggests that although the exponential rate looks smooth in a, a finer phase transition at a=1/2 may show up in higher-order corrections to the Laplace transform—this is not explored in the paper.
  • One testable extension: use the asymptotic formula to design sharp large-deviation estimates and a local limit theorem for the ERW, as the author indicates; these would require the next-order term in the singularity expansion of L_a(x,z).
  • The reflection-counting argument n=⌈(−1+2a)/(2+2a)⌉ in Lemma 13 is stated with less rigor than the rest of the paper; verifying the covering number for all a∈(-1,-3/4) by an explicit geometric construction would solidify this step.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the Laplace transform L_n(a;x)=E[e^{-xS_n}] of the Elephant Random Walk, where a∈[-1,1] is the memory parameter. It constructs the bivariate generating function L_a(x,z)=∑_{n≥0}L_{n+1}(a;x)z^n and derives, via a transport PDE, an explicit representation in terms of a function k defined by a Schwarz–Christoffel-type integral. The main theorem claims exponential asymptotics L_n(a;x)=(φ(a;x))^n(1+o(1)) for a<0, a q-dependent prefactor times (cosh x)^n for a=0, and a q-dependent prefactor times φ(a;x)^n for a>0, where φ is defined in eq. (4). The paper also derives the known LDP and analyzes regularity of φ at x=0. The a<0 and a=0 parts are plausible and the analytic-continuation strategy is interesting, but the a>0 part is not correct as written: the sign in Proposition 4 is wrong and the definition of φ in eq. (4) does not match the singularity analysis. These are load-bearing errors for the paper's central claim.

Significance. The transport-PDE approach and the use of Schwarz–Christoffel maps to control the analytic continuation of the generating function are original and potentially useful for sharp large-deviation and local-limit results. The explicit formulas for the generating function and the connection to classical special functions are attractive, and the recovery of the known LDP from the Laplace asymptotics is a nice consistency check. However, the memory regime a>0, which is one of the paper's main claims, is not established because of the sign error and the incorrect definition of φ; the manuscript is also internally inconsistent with its own Table 1. If the sign and rate-definition issues are corrected, the method may still deliver the stated results, so the paper merits a major revision rather than outright rejection.

major comments (3)
  1. [Proposition 4 / eq. (7)] For a∈(0,1), the function k defined in (9) satisfies k(t)<0 for t>0, so the statement 'k:R_+→R_+' is false. More importantly, the characteristic solution has h(x)=k(sinh x)<0, so the correct composition in (7) is A(k^{-1}(k(sinh x)+z sinh^{-1/a}(x))), not with a minus sign. With the printed minus sign, the dominant singularity is at k(sinh x)sinh^{1/a}(x)<0, while all coefficients L_n(a;x) are positive; Pringsheim's theorem then forces a positive singularity that the printed formula does not contain. Consequently the proof of Lemma 5 and the a>0 part of Theorem 1 are invalid as written.
  2. [Eq. (4) / Theorem 1, a>0] For a>0, the singularity radius is ρ_a(x)=−k(sinh x)sinh^{1/a}(x), hence φ(a;x)=1/ρ_a(x)=1/[sinh^{1/a}(x)(1/a)∫_{|x|}^{∞}sinh^{-1-1/a}(s)ds]. Eq. (4) instead gives sinh^{1/a}(x)/[(1/a)∫_{|x|}^{∞}...], which is a different quantity. The discrepancy is visible already at a=1: eq. (4) gives φ=sinh x/(coth x−1), whereas the exact transform is qe^{-nx}+(1−q)e^{nx}, whose exponential rate is e^{|x|}. Table 1 appears to use the corrected formula, so the paper is internally inconsistent. The a>0 cases of Theorem 1, Corollary 2, and Proposition 3 need to be recomputed with the correct φ.
  3. [Lemma 13] The reflection-counting formula n=⌈(−1+2a)/(2+2a)⌉ is negative for every a∈(−1,−1/2). For example, a=−0.8 gives ⌈−6.5⌉=−6. Since this count is used to prove the finite-reflection cover of the half-plane, the claimed analytic continuation of k^{-1} for a∈(−1,−1/2) is not established as written. A corrected count and a careful statement of the reflection geometry are needed before this part of Lemma 5 can be accepted.
minor comments (5)
  1. [Theorem 1, eq. (5)] For a∈(0,1] and x=0, the formula gives 0 because of the indicators 1_{x>0} and 1_{x<0}, but L_n(a;0)=1. The statement should either exclude x=0 or treat it separately.
  2. [Lemma 5] The sector is defined as Θ={z:|z−z_0|<r, |arg(z−z_0)|>θ} with θ∈(π,2π). For the principal branch this set is empty; the figure and the singularity-analysis need a sector with θ∈(0,π), as in Proposition 7 and Figure 1.
  3. [Proof of Theorem 1] In the a>0 part, the text writes 'k(sinh(z))' in two places where k(sinh x) is meant. This is likely a typo but should be corrected.
  4. [Proof of Proposition 8] The sentence 'if v_i(x)<0, the solution can also be continued' appears to be a typo: v_i(x) is defined as a positive quantity. The intended condition is probably 'if v_i(x)<∞'.
  5. [General] There are numerous minor typos ('Schawrz', 'appropiate', 'P roposition', 'transfomr', 'cotanh'), and the notation θ and r in Lemma 5 is inconsistent with Figure 1. These should be cleaned up.

Circularity Check

0 steps flagged

No significant circularity: the Laplace transform asymptotics are derived from an explicit PDE solution, not from the claimed result or from fitted data.

full rationale

The paper's central derivation is self-contained in the relevant sense: Theorem 1 is obtained by solving the transport-type PDE (10) for the generating function La(x,z), obtaining the explicit Schwarz–Christoffel representation in Proposition 4, continuing k^{-1} analytically in Lemma 5 (via Propositions 8–13), and then applying the standard singularity-analysis result Proposition 7. The growth rate φ(a;x) is defined directly in eq. (4) as an integral ratio, and Corollary 6 derives ρa(x)=1/φ(a;x) from the explicit singularity of the generating function; it is not fitted to any numerical data or assumed beforehand. The prefactors in eq. (5) come from the initial condition L1 and from the local singular behavior of A∘k^{-1}, not from a fitted parameter. The comparison with the known LDP of [12,13] in Section 3 is presented as a consistency check after Theorem 1, and the theorem is not used to prove that LDP; the direction of implication is Theorem 1 ⇒ Corollary 2 ⇒ comparison with [13]. The citations to [15,16] are contextual and motivational, not load-bearing: the recurrence (11) and the nested-derivative calculus are rederived within the proof of Proposition 4. The claim that similar expressions arise in [16,4,6] does not replace any step in the derivation. The skeptical objection about a possible sign error in Proposition 4 for a>0, if valid, is a mathematical correctness concern, not a circularity: it would affect the validity of the singularity argument but would not make the output identical to the input by construction. Consequently, no circular step meeting the quoted-evidence standard is present.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

The paper introduces no free parameters: φ(a;x), ρ_a(x), and k are explicit integral expressions with no fitted constants. No new entities are postulated. The axioms are standard complex analysis tools and the definition of the model. The ledger is clean apart from the usual background reliance on classical theorems.

axioms (5)
  • standard math Flajolet–Odlyzko singularity analysis (Proposition 7) transfers local behavior at the dominant singularity to coefficient asymptotics.
    Invoked in the proof of Theorem 1 to conclude [z^n]L_a ~ [z^n]G from F(z)~G(z) in the domain Δ(ε,θ).
  • standard math Riemann mapping theorem, Carathéodory–Osgood extension theorem, Schwarz reflection principle, and the Schwarz–Christoffel formula.
    Used in Section 2.2 (Propositions 11–13) to construct and extend the inverse of the conformal map k.
  • standard math Picard–Lindelöf existence and uniqueness and the standard continuation argument for ODE solutions in complex domains.
    Used in Proposition 8 to establish local existence and then global continuation of the inverse function f_x(y).
  • domain assumption The ERW transition kernel is correctly given by eq. (1), P(X_{n+1}=1|F_n) = (1 + a S_n/n)/2, and the recurrence L_{n+1}=L_n cosh x + (a/n) L'_n sinh x follows.
    This is the mathematical model under study; it is the starting point for the transport PDE and all subsequent claims.
  • domain assumption The integral defining k in eq. (9) has the stated convergence properties: for a<0 up to 0, for a>0 from ∞, and k is strictly monotone on R+.
    Used to define k, its inverse, and the branch of t^{1/a} in A(t); relies on the sign and integrability of the integrand.

pith-pipeline@v1.3.0-alltime-deepseek · 24861 in / 11425 out tokens · 157038 ms · 2026-08-02T00:03:23.264327+00:00 · methodology

0 comments
read the original abstract

We derive the long time asymptotic behavior of the Laplace transform of the Elephant Random Walk (ERW). The ERW is a generalization of the Simple Random Walk in which the past influences the future evolution of the process according to some memory parameter. Its transition kernel is neither space nor time homogeneous and its transition probability at the $n$th step can be written as a function of $n$ and the position of the walk at time $n - 1$. A recurrence relation for its Laplace transform allows one to find a generating function governed by a transport-type PDE whose solution can be written in terms of a Schwarz-Christoffel mapping, allowing a precise analytic control. This enables to apply singularity analysis methods to estimate the Laplace transforms.

Figures

Figures reproduced from arXiv: 2607.15125 by Juan Esaul Gonz\'alez Rangel.

Figure 1
Figure 1. Figure 1: shows the union of a half-plane and a circular sector with radius r and angle θ ∈ (π, 2π). As it is shown in the figure, a domain of the form ∆(ε, θ) can always be found in D for every value of x and a. θ ℑ(z) ℜ(z) z0 [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Vector fields of ig(x + iy) and the curve vi(x) for different values of a. In Figure 2c and Figure 2b the value of vi(x) is eventually infinite. By continuity of ig(z) in H, finding vi(x) is equivalent to finding the smallest y such that the imaginary part of ig(x + iy) vanishes, and similarly for vr(x). This happens if either ℜ(ig(z)) = 0 or [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Example of polygons P for a = −1/2 and a ∈ (−1, −1/2). When a = −1/2, P covers the entire right half plane H, but this is not the case when a < −1/2. k(−i) = − 1 a Z −i 0 s −1− 1 a (s 2 + 1)− 1 2 ds = − (−1)− 1 a a Z i 0 s −1− 1 a (s 2 + 1)− 1 2 ds = e −i π a k(i), so that k(−i) is a rotation in an angle of − π a of k(i). Next, k(i) = − 1 a Z i 0 s −1− 1 a (s 2 + 1)− 1 2 ds = − i − 1 a a Z 1 0 s −1− 1 a (1… view at source ↗
Figure 4
Figure 4. Figure 4: Two successive reflections of P along the upper side for a ∈ (−1, −3/4). We define the value of ϕ −1 to be equal to ϕ−1(γ−1(z)) in P1, and ϕ −1 (γ −1 (z)) in P2. Since ϕ −1 (z) is real valued at the border of P, its extension to each copy Pj will be real valued at the border of Pj , and the Schwarz reflection principle assures that this extension is analytic in S j Pj . Finally, the evaluation k −1 (z) = −… view at source ↗
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p019_5.png] view at source ↗
Figure 5
Figure 5. Figure 5: Plots of ρa(x) for different values of a. For positive values of a, ρa(x) < 1/ cosh(x), while ) for different values offor negative values ρa(x) > 1/ cosh(x). Proposition 14. The function x 7→ ρa(x) is analytic at 0 if a ∈ [−1, 0] and non-analytic if a ∈ (0, 1]. Since ρa(x) = 1/ϕ(a; x), and none of the functions vanish for finite x, this result implies in particular Proposition 3. Proof. Analyticity of ρa(… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 14 canonical work pages

  1. [1]

    On deviations of the sample mean

    Raghu Raj Bahadur and R Ranga Rao. “On deviations of the sample mean”. In:The Annals of Mathematical Statistics31.4 (1960), pp. 1015–1027

    1960

  2. [2]

    Elephant Random Walks and Their Connection to P´ olya-Type Urns

    Erich Baur and Jean Bertoin. “Elephant Random Walks and Their Connection to P´ olya-Type Urns”. In:Physical Review E94.5 (2016), p. 052134.doi:10.1103/PhysRevE.94.052134

    work page doi:10.1103/physreve.94.052134 2016

  3. [3]

    A Martingale Approach for the Elephant Random Walk

    Bernard Bercu. “A Martingale Approach for the Elephant Random Walk”. In:Journal of Physics A: Mathematical and Theoretical51.1 (2018), p. 015201.doi:10.1088/1751-8121/aa99c8

    work page doi:10.1088/1751-8121/aa99c8 2018

  4. [4]

    Sharp large deviations and concentration inequalities for the number of descents in a random permutation

    Bernard Bercu, Michel Bonnefont, and Adrien Richou. “Sharp large deviations and concentration inequalities for the number of descents in a random permutation”. In:Journal of Applied Probability61.3 (2024), pp. 810–833

    2024

  5. [5]

    On the Multi-Dimensional Elephant Random Walk

    Bernard Bercu and Lucile Laulin. “On the Multi-Dimensional Elephant Random Walk”. In: Journal of Statistical Physics175.6 (2019), pp. 1146–1163.doi: 10.1007/s10955-019-02266-3

    work page doi:10.1007/s10955-019-02266-3 2019

  6. [6]

    Large deviations for the leaves in some random trees

    Wlodek Bryc, David Minda, and Sunder Sethuraman. “Large deviations for the leaves in some random trees”. In:Advances in Applied Probability41.3 (2009), pp. 845–873

    2009

  7. [7]

    Amir Dembo and Ofer Zeitouni.Large Deviations Techniques and Applications. 2nd ed. Sto- chastic Modelling and Applied Probability. Berlin: Springer, 1998.doi: 10.1007/978-3-642- 03311-7

    doi:10.1007/978-3-642- 1998

  8. [8]

    Nested Derivatives: A Simple Method for Computing Series Expansions of Inverse Functions

    Diego Dominici. “Nested Derivatives: A Simple Method for Computing Series Expansions of Inverse Functions”. In:International Journal of Mathematics and Mathematical Sciences2003.58 (2003), pp. 3699–3715.doi:10.1155/S016117120320731X. REFERENCES 25

    work page doi:10.1155/s016117120320731x 2003

  9. [9]

    Driscoll and Lloyd N

    Tobin A. Driscoll and Lloyd N. Trefethen.Schwarz–Christoffel Mapping. Vol. 8. Cambridge Monographs on Applied and Computational Mathematics. Cambridge: Cambridge University Press, 2002.doi:10.1017/CBO9780511546808

    work page doi:10.1017/cbo9780511546808 2002

  10. [10]

    Analytic urns

    Philippe Flajolet, Joaquim Gabarr´ o, and Helmut Pekari. “Analytic urns”. In:The Annals of Probability33.3 (2005), pp. 1200–1233.doi: 10.1214/009117905000000026 .url: https: //doi.org/10.1214/009117905000000026

    work page doi:10.1214/009117905000000026 2005

  11. [11]

    Singularity Analysis of Generating Functions

    Philippe Flajolet and Andrew M. Odlyzko. “Singularity Analysis of Generating Functions”. In: SIAM Journal on Discrete Mathematics3.2 (1990), pp. 216–240.doi:10.1137/0403019

    work page doi:10.1137/0403019 1990

  12. [12]

    Large deviations for generalized Polya urns with arbitrary urn function

    Simone Franchini. “Large deviations for generalized Polya urns with arbitrary urn function”. In: Stochastic Processes and their Applications127.10 (2017), pp. 3372–3411.issn: 0304-4149.doi: https://doi.org/10.1016/j.spa.2017.02.010 .url: https://www.sciencedirect.com/ science/article/pii/S0304414915300314

    work page doi:10.1016/j.spa.2017.02.010 2017

  13. [13]

    Large-Deviation Theory of Increasing Returns

    Simone Franchini and Riccardo Balzan. “Large-Deviation Theory of Increasing Returns”. In: Physical Review E107.6 (2023), p. 064142.doi:10.1103/PhysRevE.107.064142

    work page doi:10.1103/physreve.107.064142 2023

  14. [14]

    Izrail Solomonovich Gradshteyn and Iosif Moiseevich Ryzhik.Table of Integrals, Series, and Products. Ed. by Daniel Zwillinger and Victor H. Moll. 8th ed. Amsterdam: Academic Press, 2014.isbn: 9780123849335

    2014

  15. [15]

    A Fixed-Point Equation Approach for the Superdiffusive Elephant Random Walk

    H´ el` ene Gu´ erin, Lucile Laulin, and Kilian Raschel. “A Fixed-Point Equation Approach for the Superdiffusive Elephant Random Walk”. In:arXiv preprint arXiv:2308.14630(2023). arXiv: 2308.14630 [math.PR]

    Pith/arXiv arXiv 2023

  16. [16]

    Elephant Polynomials

    H´ el` ene Gu´ erin, Lucile Laulin, and Kilian Raschel. “Elephant Polynomials”. In:Aequationes Mathematicae99.2 (2025), pp. 751–766.doi:10.1007/s00010-024-01094-0

    work page doi:10.1007/s00010-024-01094-0 2025

  17. [17]

    On the Limit Law of the Superdiffusive Elephant Random Walk

    H´ el` ene Gu´ erin et al. “On the Limit Law of the Superdiffusive Elephant Random Walk”. In: Electronic Journal of Probability30 (2025), pp. 1–25.doi:10.1214/25-EJP1297

    work page doi:10.1214/25-ejp1297 2025

  18. [18]

    Volume 3: Discrete Fourier Analysis, Cauchy Integrals, Construction of Conformal Maps, Univalent Functions

    Peter Henrici.Applied and Computational Complex Analysis. Volume 3: Discrete Fourier Analysis, Cauchy Integrals, Construction of Conformal Maps, Univalent Functions. Vol. 3. New York: John Wiley & Sons, 1993

    1993

  19. [19]

    An Asymptotic Distribution Theory for Eulerian Recurrences with Applications

    Hsien-Kuei Hwang, Hua-Huai Chern, and Guan-Huei Duh. “An Asymptotic Distribution Theory for Eulerian Recurrences with Applications”. In:Advances in Applied Mathematics112 (2020), p. 101960.issn: 0196-8858.doi:10.1016/j.aam.2019.101960

    arXiv 2020

  20. [20]

    Serge Lang.Complex Analysis. 4th ed. Vol. 103. Graduate Texts in Mathematics. New York: Springer, 1999.doi:10.1007/978-1-4757-3083-8

    work page doi:10.1007/978-1-4757-3083-8 1999

  21. [21]

    Elephant Random Walks with Multiple Extractions and General Reinforcement Functions

    Moumanti Podder and Archi Roy. “Elephant Random Walks with Multiple Extractions and General Reinforcement Functions”. In:Journal of Theoretical Probability39.1 (2025).doi: 10.1007/s10959-025-01471-4

    work page doi:10.1007/s10959-025-01471-4 2025

  22. [22]

    Elephants Can Always Remember: Exact Long-Range Memory Effects in a Non-Markovian Random Walk

    Gunter M. Sch¨ utz and Steffen Trimper. “Elephants Can Always Remember: Exact Long-Range Memory Effects in a Non-Markovian Random Walk”. In:Physical Review E70.4 (2004), p. 045101.doi:10.1103/PhysRevE.70.045101

    work page doi:10.1103/physreve.70.045101 2004

  23. [23]

    Stein and Rami Shakarchi.Complex Analysis

    Elias M. Stein and Rami Shakarchi.Complex Analysis. Vol. 2. Princeton Lectures in Analysis. Princeton, NJ: Princeton University Press, 2003

    2003

  24. [24]

    Gerald Teschl.Ordinary Differential Equations and Dynamical Systems. Vol. 140. Graduate Studies in Mathematics. Providence, RI: American Mathematical Society, 2012

    2012