EUVIMEDEUVIMED entdecken
Crossref

A biased variant of the ladybug clock problem

Jacob Vogelpohl, Russell May

Communications on Number Theory and Combinatorial Theory · 2026

DOI: 10.70013/e9c7d8x9 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Communications on Number Theory and Combinatorial Theory, 2026. Verfasst von Jacob Vogelpohl und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Instead of the common assumption of uniform probabilities for steps in a random walk on a graph, we generalize the steps to be biased and compute several statistics related to biased random walks on a cycle graph, more fancifully known as the ``ladybug clock problem." We obtain new explicit formulas for the distribution of probabilities for a walk to end on a particular node, the expected cover time for the cycle, and other similar statistics. We carry out these computations solely with generating functions related to the classic gambler's ruin problem.

Zitieren

APA

Vogelpohl, J., & May, R. (2026). A biased variant of the ladybug clock problem. Communications on Number Theory and Combinatorial Theory. https://doi.org/10.70013/e9c7d8x9

Vancouver

Vogelpohl J, May R. A biased variant of the ladybug clock problem. Communications on Number Theory and Combinatorial Theory. 2026. doi:10.70013/e9c7d8x9

BibTeX
@article{Vogelpohl2026,
  author = {Vogelpohl, Jacob and May, Russell},
  title = {A biased variant of the ladybug clock problem},
  journal = {Communications on Number Theory and Combinatorial Theory},
  year = {2026},
  doi = {10.70013/e9c7d8x9}
}
Kostenlos starten →