Random generation of source vectors with a fixed preponderant property

DOI10.1016/J.TCS.2025.115630MaRDI QIDQ6888781zbMATH OpenFDO

Authors Julien David

Publication date 5 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115630

zbMATH Keywords

Markov chainsrandom generationShannon entropysource vectorssymmetric concave functions

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Measures of information, entropy (94A17)

Cites work

• A calculus for the random generation of labelled combinatorial structures
• A generic approach for the unranking of labeled combinatorial classes
• A Markov chain for lattice polytopes
• An average study of hypergraphs and their minimal transversals
• Average case analysis of Moore's state minimization algorithm
• Boltzmann samplers for first-order differential specifications
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Good predictions are worth a few comparisons
• scientific article; zbMATH DE number 3900794 (Why is no real title available?)
• Lambda terms of bounded unary height
• Multi-dimensional Boltzmann sampling of languages
• Polynomial tuning of multiparametric combinatorial samplers
• Random generation of deterministic acyclic automata using Markov chains
• Random Generation of Directed Acyclic Graphs
• Towards a realistic analysis of the QuickSelect algorithm

Cited in

(1)

• Approximate Cartesian tree matching with one difference

This page was built for publication: Random generation of source vectors with a fixed preponderant property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888781)