“…Indeed motivated by the DS-type Markov chain (see [DS1,2,3], [JLW], [LW2], [RW], [DW]) that the sample paths go to the offsprings (vertical edges), and the offsprings of the neighbors (slanted edges), we can define a slanted set of edges on X (also on X ∼ as in Section 3) by E s = {(x, y) : |y| − |x| = 1, (x, y) ∈ E v , dist(K x , K y ) ≤ κr min{|x|,|y|} }; Note that in this case E v ∪ E s satisfies (i) there is no horizontal edges in the graph; and…”