Discrete Mathematics & Theoretical Computer Science · 2008 · 25 citations · 6 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsCombinatorial EnumerationGenerating FunctionsIterative SolversNumerical AlgorithmsRandom Number GenerationNewton ConvergenceTest Oracles
Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.
6
Elementary Theory of Analytic Functions of One or Several Complex Variables
R. P. Boas · Science · 1964 · 122 citations
Boltzmann Sampling of Unlabelled Structures
Philippe Flajolet, Éric Fusy, Carine Pivoteau · 2007 · 82 citations · Full text