From the 1 of 5 linked papers with an AI index.
5 papers
Optimal lower bound for the variance of hitting times for simple random walks on graphs
Rafael Chiclana, Yuval Peres
The paper proves a sharp lower bound on the variance of hitting times for simple random walks on graphs, showing it is at least on the order of the squared expected hitting time di…
Harnack inequality for -harmonic functions: improved dimension dependence via tug of war
Yuval Peres, Han Wang
Let . The Harnack inequality and Hölder continuity for -harmonic functions in bounded domains in are usually proved via Moser iteration. In 2013 Luiro, Parv…
Mixing times of step-reinforced random walks
Yuval Peres, Shuo Qin
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 int…
Divisible sandpiles via random walks in random scenery
Ahmed Bou-Rabee, Yuval Peres, Ecaterina Sava-Huss
We analyze an optimal stopping problem for random walk in random scenery on general graphs, and determine when it has a finite optimum. We use this to extend a theorem of Levine, M…
Transition probabilities of step-reinforced random walks
Yuval Peres, Shuo Qin
The step-reinforced random walk (SRRW), where each step may replicate a randomly chosen past step, exhibits complex dependencies on the history. This paper introduces a generalized…