Complex Networked Systems – Group DiscussionsUpcoming Topics
Ongoing Topic
Past Topics
I did a little experiment on the first example we discussed today (n binary bits, doing nothing with prob p, and flip a uniformly selected bit with prob 1p) in MATLAB. I calculated theoretically the total variation distance starting from one state when n=10, and plotted in the above figure. Agreeing with our intuition, the mixing time for larger p (i.e., larger prob of doing nothing) is longer.
