The speed of a biased walk on a Galton–Watson tree without leaves is monotonic for low values of bias

Abstract We show that for $\lambda\in[0,{m_1}/({1+\sqrt{1-{1}/{m_1}}})]$ , the biased random walk’s speed on a Galton–Watson tree without leaves is strictly decreasing, where $m_1\geq 2$ . Our result extends the monotonic interval of the speed on a Galton–Watson tree.

Authors

Institutions

Publication Details

Journal
Journal of Applied Probability
Published
2025-03-05
DOI
https://doi.org/10.1017/jpr.2024.113
Citations
1
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
3.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The speed of a biased walk on a Galton–Watson tree without leaves is monotonic for low values of bias

Song He, Longmin Wang, Kainan Xiang
1 citations
Journal of Applied Probability
Stochastic processes and statistical mechanics
3.69
article

The speed of a biased walk on a Galton–Watson tree without leaves is monotonic for low values of bias

Song He, Longmin Wang, Kainan Xiang
article en
1 citations

Abstract

Abstract We show that for $\lambda\in[0,{m_1}/({1+\sqrt{1-{1}/{m_1}}})]$ , the biased random walk’s speed on a Galton–Watson tree without leaves is strictly decreasing, where $m_1\geq 2$ . Our result extends the monotonic interval of the speed on a Galton–Watson tree.

Journal of Applied ProbabilityVol. 62(3)
Nankai University (CN), Huaiyin Normal University (CN), Xiangtan University (CN)
Openalex Percentile: Top 13%
Stochastic processes and statistical mechanics
3.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.