OpenAlex ·

Once-reinforced random walk on $\mathbb{Z}^d$ has range exponent at least $d/(d+1)$

Ahmed Bou‐Rabee and Yuval Peres

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.00090
Original
Read it at the publisher
Topics
Mathematical PhysicsNumerical Analysis

Abstract

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 range in the first $n$ steps was predicted by Ordemann et al. (2000) and independently by Beffara (2011) to have order $n^{d/(d+1)}$ on $\mathbb{Z}^d$. We prove the corresponding lower bound in every dimension $d\geq2$ and for every reinforcement parameter $β$.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Mathematical Physics

Get the few papers worth your time in Mathematical Physics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics