Abstract
There are n rocks forming a circle on a river, and there is a frog on one of those rocks. The frog jumps up himself with probability 1/3, jumps up to the right rock with probability 1/3 and jumps to the left one with probability 1/3, too. The frog problem consists of knowing: where will the frog be after t times?
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
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2001). Random Walks. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive