Liftings of Tree-Structured Markov Chains - (Extended Abstract)

d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A "lifting" of a Markov chain is a larger chain obtained by replacing each state of the original chain by a set of states, with transition probabilities defined in such a way that the lifted chain projects down exactly to the original one. It is well known that lifting can potentially speed up the mixing time substantially. Essentially all known examples of efficiently implementable liftings have required a high degree of symmetry in the original chain. Addressing an open question of Chen, Lov

• Type: Journal
• Year: 2010
• Where: APPROX
• Authors: Thomas P. Hayes, Alistair Sinclair
• Keywords: Algorithms, APPROX 2010, Chains, Markov Chains, Original Chain