arXiv (All)
open access
Laws of the iterated logarithm for the range of once-reinforced random walk on $\mathbb{Z}$
In this paper, we study once-reinforced random walk on $\mathbb{Z}$, and prove sharp Chung-type and Hartman-Wintner laws of the iterated logarithm for the range. Let $R_n$ denote the range at time $n$ and let $c>0$ be the reinforcement parameter. Then, almost surely, \begin{equation*} \liminf_{n\t
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
- Kozma's centrally excited walk converges to a Euclidean ball#1234529
- Mixing time under monotone censoring#1160740
- Sharp Rogers--Shephard Inequalities for Rényi Entropy#1326966
- Random walk and Weber-Schafheitlin integral: generalizations and discussion#974840
- Uniform meandric systems as percolation on planar maps: conjectures and a numerical study#1199004
Record · ID 1468394
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