Skip to content
DraconiticResearch
Search Sources API
189,273 studies31 sourcesUpdated 1 min ago
PreprintarXiv licencearXiv

Biased random walk on a locally infinite Galton-Watson tree

Abstract

We propose a new variant of a biased random walk on a Galton-Watson tree, in which some vertices have infinitely many children. These vertices induce a natural regeneration structure, which allows to study differentiability and also monotonicity of the speed of the random walk in the bias parameter. Additionally, we show that the speed in this model is the limit of the speed of random walks on appropriate locally finite trees.

Related

  1. Infinite-mean Galton-Watson trees have zero random-interchange threshold
    Andreas Klippel, Benjamin Lees, Christian Mönch
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
  2. A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range
    Madhulatha Mandarapu, Sandeep Kunkunuru
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  3. Branching Random Walks on Multi-Type Galton–Watson Trees: A Multifractal Analysis
    Najmeddine Attia, Mohammed Balegh
    Fractal and FractionalPeer-reviewedCC BY 4.0Mathematical physicsCrossref
  4. Asymptotic behavior of some strongly critical decomposable multi-type Galton-Watson processes with immigration
    Matyas Barczy, Dániel Bezdány
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Functional limit theorems for Galton--Watson processes with inhomogeneous immigration
    Matyas Barczy, Dániel Bezdány
    arXivPreprintarXiv licenceFull textProbabilityarXiv
BibTeX
@misc{nagel2026biased,
  title = {{Biased random walk on a locally infinite Galton-Watson tree}},
  author = {Jan Nagel},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.08181},
  eprint = {2610.08181},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.08181},
}
RIS
TY  - UNPB
TI  - Biased random walk on a locally infinite Galton-Watson tree
AU  - Jan Nagel
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2610.08181
UR  - https://arxiv.org/abs/2610.08181
AB  - We propose a new variant of a biased random walk on a Galton-Watson tree, in which some vertices have infinitely many children. These vertices induce a natural regeneration structure, which allows to study differentiability and also monotonicity of the speed of the random walk in the bias parameter. Additionally, we show that the speed in this model is the limit of the speed of random walks on appropriate locally finite trees.
ER  -