arXiv (All)
open access
Biased random walk on a locally infinite Galton-Watson tree
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recurrence and capacity of stable branching random walks#818723
- Recurrence and capacity of stable branching random walks#808731
- Random walk in a regenerating random environment#1249199
- Mass erasure on infinitely measured $\mathbb{R}$-trees I: construction and limit theorems#1123359
- Tree walks and the spectrum of random graphs#652722
Record · ID 1217916
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive