arXiv (All)
open access
Recurrence, Transience, and the Rate of Escape for Elephant Random Walks with Two Memory Channels
We study the one-dimensional elephant random walk with two memory channels introduced by Saha [Phys.\ Rev.\ E \textbf{106}, L062105 (2022)] with memory parameter $p\in(0,1)$. Maulik, Roy and Sadhukhan [arXiv:2509.10225] proved recurrence for $p\le11/16$ and transience for $p>7/8$, leaving the range
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
- The Law of the Iterated Logarithm for a Class of Transient Random Walk in Random Environment#69264
- Ratios of partition functions for the log-gamma polymer#954808
- Partially Observable Restless Bandits for Age-Optimal Scheduling over Markov Channels#216772
- Mixing time under monotone censoring#1160740
- Sharpening Tax in Post-Training#1167700
Record · ID 974746
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