The last vertex to be visited
A token performs a simple random walk on a cycle of vertices labelled , starting at and moving to either neighbour with probability each step. What is the probability that vertex , the one diametrically opposite the start, is the last vertex to be visited? Give a decimal to four places.
Show hints (2)+
- Before visiting vertex 5, the walk must reach one of its neighbours. What must happen next?
- From neighbour 4, vertex 5 is last if the walk reaches 6 the long way before stepping onto 5. That is gambler's ruin.
Answer
Reveal answer →Final answer
0.1111 (± 0.001)
Create a free account to see the full worked solution and track your progress.
Interview format: Market Maker, Systematic & Data-Driven Trading