arXiv (All)
open access
Once-reinforced random walk on $\mathbb{Z}^d$ has range exponent at least $d/(d+1)$
In once-reinforced random walk, introduced by Davis (1990), every edge starts with weight one and is assigned weight $β\geq1$ after its first crossing. At each step the walker chooses an incident edge with probability proportional to its weight. For sufficiently large reinforcement $β$, the expected
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
- Aperiodic random walks: uniform estimates, local limits and invariance principles#924157
- Aperiodic random walks: uniform estimates, local limits and invariance principles#919926
- Paths maximize the expected range of graph-indexed random walks#1014316
- A Vertex-Localized Positive Square-Energy Strengthening of Turán's Theorem#974570
- Hardy--Littlewood Maximal Operator and Two-Layer Muckenhoupt Weights on Infinite Rooted $k$-Ary Trees#1070303
Record · ID 1154713
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