Approximately Sampling Elements with Fixed Rank in Graded Posets

Abstract

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often #P-complete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately generate samples with any fixed rank in expected polynomial time. Our arguments do not rely on the typical proofs of log-concavity, which are used to construct a stationary distribution with a specific mode in order to give a lower bound on the probability of outputting an element of the desired rank. Instead, we infer this directly from bounds on the mixing time of the chains through a method we call balanced bias.A noteworthy application of our method is sampling restricted classes of integer partitions of n. We give the first provably efficient Markov chain algorithm to uniformly sample integer partitions of n from general restricted classes. Several observations allow us to improve the efficiency of this chain to require O(n 1/2 log(n)) space, and for unrestricted integer partitions, expected O(n 9/4 ) time. Related applications include sampling permutations with a fixed number of inversions and lozenge tilings on the triangular lattice with a fixed average height.

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases

“…A year later, Kuperberg [Kup96] produced an elegant and signi cantly shorter proof using analysis of the partition function of the six-vertex model with domain wall boundary conditions. Other important connections of the model to combinatorics and probability include tilings of the Aztex diamond and the arctic circle theorem [CEP96,FS06], sampling lozenge tilings [LRS01,Wil04,BCFR17], and enumerating 3-colorings of lattice graphs [RT00,CR16].…”

Polynomial tuning of multiparametric combinatorial samplers

“…Uniform random generation of combinatorial structures forms a prominent research area of computer science with multiple important applications ranging from automated software testing techniques, see [CH00], to complex simulations of large physical statistical models, see [Bha+17]. Given a formal specification defining a set of combinatorial structures (for instance graphs, proteins or tree-like data structures) we are interested in their efficient random sampling ensuring the uniform distribution among all structures sharing the same size.…”

Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions

“…Leveraging additional symmetries of partitions, Arratia and DeSalvo [1] gave a sampling algorithm that runs in expected O( √ n) time and space. Taking a completely different approach, Bhakta et al [5] recently gave the first rigorous Markov chain for sampling partitions, again utilizing Boltzmann sampling Figure 1: Young diagrams of Bose-Einstein condensates with shape (2,1), where the colors (gray, green, blue) correspond to the numbers (1,2,3).…”