Sampling biased monotonic surfaces using exponential metrics

DOI10.1017/S0963548320000188zbMath1469.60231arXiv1704.07322WikidataQ115562798 ScholiaQ115562798MaRDI QIDQ4987255

Dana Randall, Sam Greenberg, Amanda Pascoe Streib

Publication date: 30 April 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.07322

zbMATH Keywords

Markov chainsampling biased surfaces

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (3)

Mixing time and cutoff for one-dimensional particle systems ⋮ Runtime Analysis of a Co-Evolutionary Algorithm ⋮ Polymer dynamics via cliques: new conditions for approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamics of lattice triangulations on thin rectangles
• Mixing times of monotone surfaces and SOS interfaces: a mean curvature approach
• Mixing of the exclusion process with small bias
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Faster random generation of linear extensions
• Mixing times of lozenge tiling and card shuffling Markov chains
• Glauber dynamics on trees and hyperbolic graphs
• Analyzing Glauber dynamics by comparison of Markov chains
• Markov Chain Algorithms for Planar Lattice Structures
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• A more rapidly mixing Markov chain for graph colorings
• Phase Transitions in Random Dyadic Tilings and Rectangular Dissections
• Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations

This page was built for publication: Sampling biased monotonic surfaces using exponential metrics