An algorithm for generating necklaces of beads in two colors
Discrete Mathematics
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Regular Article: Necklaces, MSS Sequences, and DNA Sequences
Advances in Applied Mathematics
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Analytic Combinatorics
Random sampling of plane partitions
Combinatorics, Probability and Computing
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing
Boltzmann samplers for first-order differential specifications
Discrete Applied Mathematics
| Hi-index | 5.23 |
This paper is devoted to the random generation of a new operator which we call v-balanced colored cycle, a cycle of which the components are assigned different colors with frequencies restricted by a vector v. We propose an efficient approximate-size sampler (of linear expected time complexity) following the Boltzmann model introduced by Duchon et al. (2004) [9]. One of our motivations is to show that the absence of a decomposable specification, which form the basis of the Boltzmann model, can be circumvented by mixing Boltzmann samplers with other methods of random generation.