A Branching Process with Geometric Emigration and the "Have Your Cookie and Eat It" Random Walk
Abstract
We consider a random walk on the integers that at each site is biased to step right until the first time it has stepped left from that site, thereafter stepping left or right from that site with equal chance, introduced by Pinsky. Pinsky calculated the speed of the walk and the probability that such a walk escapes to infinity for some ranges of p and conjectured these formulas hold over a wider range. To study this walk, we introduce a branching process featuring geometric emigration and answer some questions concerning its life-periods, transience and recurrence, and the mean of its stationary distribution when positive recurrent. We apply these results to confirm Pinsky's predictions. For another application, we calculate the speed and escape probability of a related self-interacting random walk.
Related
- On the critical branching random walk I: branching capacity and visiting probability
- The Q-process for the general mother-dependent multitype branching process
- The continuous Derrida-Retaux branching process in the Brownian CRT
- A multitype Markovian branching process with one-type population size dependence
- Capacities and Hitting Times for Simple and (critical) Branching Random Walk Sausages
BibTeX
@misc{carper2026branching,
title = {{A Branching Process with Geometric Emigration and the "Have Your Cookie and Eat It" Random Walk}},
author = {Patrick Carper},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.06311},
eprint = {2609.06311},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.06311},
}
RIS
TY - UNPB
TI - A Branching Process with Geometric Emigration and the "Have Your Cookie and Eat It" Random Walk
AU - Patrick Carper
PY - 2026
DA - 2026/09/05
PB - arXiv
DO - 10.48550/arxiv.2609.06311
UR - https://arxiv.org/abs/2609.06311
AB - We consider a random walk on the integers that at each site is biased to step right until the first time it has stepped left from that site, thereafter stepping left or right from that site with equal chance, introduced by Pinsky. Pinsky calculated the speed of the walk and the probability that such a walk escapes to infinity for some ranges of p and conjectured these formulas hold over a wider range. To study this walk, we introduce a branching process featuring geometric emigration and answer some questions concerning its life-periods, transience and recurrence, and the mean of its stationary distribution when positive recurrent. We apply these results to confirm Pinsky's predictions. For another application, we calculate the speed and escape probability of a related self-interacting random walk.
ER -