Sampling biased lattice configurations using exponential metrics

Monotonic surfaces spanning finite regions of Zd arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. We explore how we can sample these surfaces when the distribution is biased to favor higher surfaces. We show that a natural local chain is rapidly mixing with any bias for regions in Z2, and for bias λ > d2 in Zd, when d > 2. Moreover, our bounds on the mixing time are optimal on d-dimensional hyper-cubic regions. The proof uses a geometric distance function and introduces a variant of path coupling in order to handle distances that are exponentially large.

[1]  Elchanan Mossel,et al.  Mixing times of the biased card shuffling and the asymmetric exclusion process , 2002, math/0207199.

[2]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[3]  Sudheer Sahu,et al.  Stochastic Analysis of Reversible Self-Assembly , 2008 .

[4]  D. Wilson.  Mixing times of lozenge tiling and card shuffling Markov chains , 2001, math/0102193.

[5]  R. Durrett.  Probability: Theory and Examples , 1993 .

[6]  Qi Cheng,et al.  Linear Self-Assemblies: Equilibria, Entropy and Convergence Rates , 2003 .

[7]  Cristopher Moore,et al.  An n-Dimensional Generalization of the Rhombus Tiling , 2001, DM-CCG.

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9]  N. Seeman,et al.  DNA double-crossover molecules. , 1993, Biochemistry.

[10]  Sudheer Sahu,et al.  Compact Error-Resilient Computational DNA Tiling Assemblies , 2004, DNA.

[11]  Dana Randall,et al.  Analyzing Glauber Dynamics by Comparison of Markov Chains , 1998, LATIN.

[12]  Martin E. Dyer,et al.  Faster random generation of linear extensions , 1999, SODA '98.

[13]  E. Winfree.  Simulations of Computing by Self-Assembly , 1998 .

[14]  N. Seeman.  DNA in a material world , 2003, Nature.

[15]  Martin E. Dyer,et al.  A more rapidly mixing Markov chain for graph colorings , 1998, Random Struct. Algorithms.

[16]  Dana Randall,et al.  Markov Chain Algorithms for Planar Lattice Structures , 2001, SIAM J. Comput..

[17]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[18]  Dana Randall,et al.  Torpid mixing of local Markov chains on 3-colorings of the discrete torus , 2007, SODA '07.