(a) A biased one-dimensional walk takes a step with probability and a step with…
PHYSICS · Subjective · Fermi University Physics · Mathematical Methods for Physics · Probability, statistics and stochastic methods · Probability, statistics and stochastic methods
Error, Chance and the Machine, Ch Random walks and Markov chains
Problem
(a) A biased one-dimensional walk takes a step +1 with probability p=0.6 and a step −1 with probability q=0.4, independently at every step. Its single-step characteristic function is λ(θ)=⟨eiθX⟩=peiθ+qe−iθ. Using Pn(x)=2π1∫−ππe−ixθλ(θ)ndθ find P4(0), the probability of being back at the origin after 4 steps. (b) A two-state chain has transition matrix P=(0.950.100.050.90). Find its stationary distribution π. Use the trace of P to find its second eigenvalue λ2, and give the spectral gap and the relaxation time trel in steps. (c) For the same two-state chain let An=1 when the chain is in state 1 at step n and An=0 otherwise. Show that ⟨An+1−π1∣Xn⟩=λ2(An−π1), and deduce that in equilibrium ρ(k)=λ2k. Hence find the integrated autocorrelation time τint, and the factor by which the error bar of the fraction of a long run spent in state 1 exceeds the naive one.