Indexed metadata

Biased random walk on a locally infinite Galton-Watson tree

Jan Nagel

Source record

Source: arXiv

Published: Oct 6, 2026

arXiv: 2610.08181

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Biased random walk on a locally infinite Galton-Watson tree — Mathematical Frontier Network