Random generation of combinatorial structures: Boltzmann samplers and beyond

Details Random generation of combinatorial structures: Boltzmann samplers and beyond Random generation of combinatorial structures: Boltzmann samplers and beyond

2011-12-21

arxiv.org/abs/1112.5071v1

Computer Science

Data Structures and Algorithms

Winter Simulation Conference (2011)

Scientific paper

The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size is somehow relaxed, though uniformity among objects of each size is still ensured. Generating functions, rather than the enumeration sequences they are based on, are the crucial ingredient. We give a brief description of the general theory, as well as a number of newer developments.

Affiliated with

Also associated with

No associations

Rating

Random generation of combinatorial structures: Boltzmann samplers and beyond does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random generation of combinatorial structures: Boltzmann samplers and beyond, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random generation of combinatorial structures: Boltzmann samplers and beyond will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193297