论文信息 - Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits.

Olivier Bodini | Matthieu Dien | Antoine Genitrini | Frédéric Peschanski

[1] Olivier Bodini,et al. A Quantitative Study of Pure Parallel Processes , 2014, Electron. J. Comb..

[2] Stefan Felsner,et al. Markov chains for linear extensions, the two-dimensional case , 1997, SODA '97.

[3] Mark Huber,et al. Fast perfect sampling from linear extensions , 2006, Discret. Math..

[4] Jérémie O. Lumbroso. Optimal Discrete Uniform Generation from Coin Flips, and Applications , 2013, ArXiv.

[5] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .

[6] Claude E. Shannon,et al. The mathematical theory of communication , 1950 .

[7] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .

[8] Rolf H. Möhring,et al. Computationally Tractable Classes of Ordered Sets , 1989 .

[9] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .

[10] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[11] P. Flajolet,et al. Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[12] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[13] R. Stanley. Enumerative Combinatorics by Richard P. Stanley , 2011 .