Approximately sampling elements with fixed rank in graded posets

Ben Cousins
Ben Cousins
Matthew Fahrbach
Matthew Fahrbach

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 1828-1838, 2017.

Cited by: 6|Views3
EI

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 edge...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments