Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Biased Boltzmann sam ...
Conference paper

Biased Boltzmann samplers and generation of extended linear languages with shuffle

Alexis Darrasse (1), Konstantinos Panagiotou (2), Olivier Roussel (1), Michele Soria (1)
(1) Algorithmes, Programmes et Résolution
(2) Max-Planck-Institut für Informatik
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Proceedings
DOI
10.46298/dmtcs.2989
License
https://about.hal.science/hal-authorisation-v1
Indicators
613
Views
525
Downloads

Biased Boltzmann samplers and generation of extended linear languages with shuffle

Alexis Darrasse (1), Konstantinos Panagiotou (2), Olivier Roussel (1), Michele Soria (1)
(1) Algorithmes, Programmes et Résolution
(2) Max-Planck-Institut für Informatik
Abstract
This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samplers for words defined by regular specifications containing shuffle operators and linear recursions. This sampler has linear complexity in the size of the output, where the complexity is measured in terms of real-arithmetic operations and evaluations of generating functions.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Boltzmann samplers
  • biased distributions
  • combinatorial specifications
  • shuffle operator
  • generating functions
  • random sampling
Cited by

Source: OpenCitations

  • Asymptotic Properties of Some Minor-Closed Classes of Graphs

    arXiv (Cornell University)

    Authors : MIREILLE BOUSQUET-MÉLOU ORCID, KERSTIN WELLER

    Journal reference : Volume 23, 2014, pp. 749-795

    DOI : 10.1017/s0963548314000303
Preview
Loading PDF preview...