Controlled non-uniform random generation of decomposable structures
DOI10.1016/J.TCS.2010.05.010zbMATH Open1273.05232DBLPjournals/tcs/DenisePT10OpenAlexW2053350156WikidataQ57221119 ScholiaQ57221119MaRDI QIDQ708203FDOQ708203
Authors: D. Kharzeev 
Publication date: 11 October 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.010
Recommendations
- A calculus for the random generation of labelled combinatorial structures
- Uniform random generation of decomposable structures using floating-point arithmetic
- Random generation of combinatorial structures from a uniform distribution
- scientific article; zbMATH DE number 1552330
- Random combinatorial structures: the convergent case
combinatoricsrandom generationdecomposable structurescombinatorial specificationnon-uniform distribution
Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05) Combinatorial aspects of partitions of integers (05A17) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- GFUN
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- Analytic combinatorics
- Title not available (Why is that?)
- Singularity Analysis of Generating Functions
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Motif statistics.
- Relax, but don't be too lazy
- Fast multiplication of large numbers
- Title not available (Why is that?)
- D-finite power series
- Combinatorics of RNA structures with pseudoknots
- Faster integer multiplication
- Title not available (Why is that?)
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- A calculus for the random generation of labelled combinatorial structures
- Uniform random generation of decomposable structures using floating-point arithmetic
- Non-uniform random generation of generalized Motzkin paths
- Title not available (Why is that?)
- Boltzmann sampling of unlabelled structures
- Random generation of words in an algebraic language in linear binary space
- Differential equations for algebraic functions
- Boltzmann oracle for combinatorial systems
- Combinatorics of RNA secondary structures
- Title not available (Why is that?)
- The cycle lemma and some applications
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Non-redundant random generation algorithms for weighted context-free grammars
- Counting, Generating, Analyzing and Sampling Tree Alignments
- Random generation of combinatorial structures from a uniform distribution
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
- Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
Uses Software
This page was built for publication: Controlled non-uniform random generation of decomposable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708203)
