arXiv (All)
open access
A Generalized Elephant Random Walk with Time-Dependent Memory
The elephant random walk (ERW) is a discrete-time random walk with complete memory. At every step the walker chooses one of the previous increments at random and then either repeats with a constant probability $p\in [0,1]$ or reverses it. Since its introduction by Schütz and Trimper, the model has b
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A fixed-point equation approach for the superdiffusive elephant random walk#1235321
- Recurrence, Transience, and the Rate of Escape for Elephant Random Walks with Two Memory Channels#974746
- The Law of the Iterated Logarithm for a Class of Transient Random Walk in Random Environment#69264
- A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity#1084677
- Mass erasure on infinitely measured $\mathbb{R}$-trees I: construction and limit theorems#1123359
Record · ID 1327655
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive