View each of the three level-one triangles in as a copy of . Observe the walk only when it moves from one corner of such a copy to a different corner. By symmetry, the next of the two other corners is equally likely, so this embedded chain is the simple random walk on the coarse graph . Part (a) says it makes an expected five coarse transitions before reaching or .
Articles by others on the same topic
There are currently no matching articles.