English

Generalized range of slow random walks on trees

Probability 2024-09-20 v3

Abstract

In this work, we are interested in the set of visited vertices of a tree T\mathbb{T} by a randomly biased random walk X:=(Xn,nN)\mathbb{X}:=(X_n,n \in \mathbb{N}). The aim is to study a generalized range, that is to say the volume of the trace of X\mathbb{X} with both constraints on the trajectories of X\mathbb{X} and on the trajectories of the underlying branching random potential V:=(V(x),xT)\mathbb{V}:=(V(x), x \in \mathbb{T}). Focusing on slow regime's random walks (see [HS16b], [AC18]), we prove a general result and detail examples. These examples exhibit many different behaviors for a wide variety of ranges, showing the interactions between the trajectories of X\mathbb{X} and the ones of V\mathbb{V}.

Keywords

Cite

@article{arxiv.2111.05029,
  title  = {Generalized range of slow random walks on trees},
  author = {Pierre Andreoletti and Alexis Kagan},
  journal= {arXiv preprint arXiv:2111.05029},
  year   = {2024}
}

Comments

58 pages

R2 v1 2026-06-24T07:31:59.047Z