Abstract
There are n rocks forming a circle in a river, and there is a frog on one of these rocks. The frog remains stationary with probability 1/3, jumps to the right rock with probability 1/3 and jumps to the left one with probability 1/3. The frog problem is: where will the frog be after time t?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2011). Random Walks. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-17364-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17363-9
Online ISBN: 978-3-642-17364-6
eBook Packages: Computer ScienceComputer Science (R0)