6 citations · 14 across the 4 of their papers we have counts for
6 papers
Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains
Sarah Miracle, Amanda Pascoe Streib, Noah Streib
The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content…
Rapid Mixing of -Class Biased Permutations
Sarah Miracle, Amanda Pascoe Streib
In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements and are placed in order $(…
Sampling Biased Monotonic Surfaces using Exponential Metrics
Sam Greenberg, Dana Randall, Amanda Pascoe Streib
Monotonic surfaces spanning finite regions of arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to…
Stratified Sampling for the Ising Model: A Graph-Theoretic Approach
Amanda Streib, Noah Streib, Isabel Beichl +1
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Mark…
Mixing Times of Self-Organizing Lists and Biased Permutations
Prateek Bhakta, Sarah Miracle, Dana Randall +1
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time Θ(n^3 \log n) i…
Algorithms for Sampling 3-Orientations of Planar Triangulations
Sarah Miracle, Dana Randall, Amanda Pascoe Streib +1
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge…