MathCastle
Linear AlgebraSuperchallengeMarkov Chains & Long-Run Behavior

Markov Chains & Long-Run Behavior · Superchallenge problem

A walker on the four vertices of a tetrahedron moves each step to one of the other three vertices, chosen uniformly. Let pnp_n be the probability of being at the starting vertex after nn steps (p0=1p_0 = 1). Evaluate ∑n=0∞(pn−14)\displaystyle\sum_{n=0}^{\infty}\left(p_n - \tfrac14\right). Express your answer as a common fraction.