arXiv (OAI Expanded)
open access
Mixing times of step-reinforced random walks
We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $α$ the next step is chosen uniformly from the previous steps of the walk. We prove that the
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
- Mixing times of Markov chains : acceleration and cutoff in random environment#124521
- Additive processes on the real line and Loewner chains#1128496
- Long Time Behavior of General Markov Additive Processes#426346
- Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics#1013042
- Induced random mixed states are symmetric Dirichlet mixtures#987170
Record · ID 1109037
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