An open API service indexing awesome lists of open source software.

https://github.com/jlumbroso/boltzoc

Fast, Standalone Oracle for Analytic Sampling of Trees
https://github.com/jlumbroso/boltzoc

analytic-combinatorics analytic-samplers combinatorics random-generation

Last synced: 3 months ago
JSON representation

Fast, Standalone Oracle for Analytic Sampling of Trees

Awesome Lists containing this project

README

          

# Fast, Standalone Boltzmann Sampler Oracle for Trees

This repository contains a fast, standalone C implementation of "oracle"
necessary to find the singularity (first positive real value at which the
generating function diverges) for the generating functions of tree-like
combinatorial structures.

## Acknowledgment

This software was originally implemented by [Alexis Darrasse](https://scholar.google.com/citations?user=gv78_KoAAAAJ&hl=en) in 2010,
in the context of his doctoral thesis.

## Bibliography

Darrasse, Alexis (2010). "[Structures arborescentes complexes: analyse combinatoire, génération aléatoire et applications.](http://www.ortsa.com/lip6_these/docs/these.pdf)" (Doctoral dissertation, Paris 6).

Duchon, Philippe, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer (2004). "[Boltzmann samplers for the random generation of combinatorial structures.](http://algo.inria.fr/flajolet/Publications/DuFlLoSc04.pdf)" *Combinatorics, Probability and Computing*, 13(4-5), 577-625.

Pivoteau, Carine, Bruno Salvy and Michèle Soria (2012). "[Algorithms for combinatorial structures: Well-founded systems and Newton iterations.](https://arxiv.org/abs/1109.2688)" *Journal of Combinatorial Theory, Series A*, 119(8), 1711-1773.