Advertisement

Random Walks

  • Stasys Jukna
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)

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?

Keywords

Random Walk Boolean Function Search Problem Conjunctive Normal Form Independent Copy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Stasys Jukna
    • 1
    • 2
  1. 1.Informatik - FB 20, Theoretische InformatikJohann Wolfgang Goethe-UniversitätFrankfurtGermany
  2. 2.Institute of Mathematics and InformaticsVilniusLethuania

Personalised recommendations