Kumar, Anil VS and Ramesh, H (2001) Coupling vs. conductance for the Jerrum-Sinclair chain. In: Random Structures and Algorithms, 18 (1). pp. 1-17.
Coupling_vs._Conductance_for_the.pdf - Published Version
Restricted to Registered users only
Download (149Kb) | Request a copy
We address the following question: is the causal coupling method as strong as the conductance method in showing rapid mixing of Markov chains? A causal coupling is a coupling which uses only past and present information, but not information about the future. We answer the above question in the negative by showing that there exists a bipartite graph G such that any causal coupling argument on the Jerrum–Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect matchings of G must necessarily take time exponential in the number of vertices in G. In contrast, the above Markov chain on G has been shown to mix in polynomial time using conductance arguments.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to John Wiley & Sons|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||26 Dec 2008 10:49|
|Last Modified:||19 Sep 2010 04:53|
Actions (login required)