A calculus for the random generation of labelled combinatorial structures
From MaRDI portal
binary treesCayley treescycle decomposition of permutationsfunctional graphshierarchieslabelled combinatorial objectsrandom generationset partitions
Exact enumeration problems, generating functions (05A15) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
- A method and two algorithms on the theory of partitions
- A Recurrence Related to Trees
- Automatic average-case analysis of algorithms
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 4136357 (Why is no real title available?)
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3959436 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3655943 (Why is no real title available?)
- scientific article; zbMATH DE number 3755865 (Why is no real title available?)
- scientific article; zbMATH DE number 16479 (Why is no real title available?)
- scientific article; zbMATH DE number 45266 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3513784 (Why is no real title available?)
- scientific article; zbMATH DE number 1142298 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3405492 (Why is no real title available?)
- On a recurrence involving Stirling numbers
- On the Altitude of Nodes in Random Trees
- Random mappings with constraints on coalescence and number of origins
- Singularity Analysis of Generating Functions
- Solution of a Divide-and-Conquer Maximin Recurrence
- The expected linearity of a simple equivalence algorithm
- Une théorie combinatoire des séries formelles
- Uniform Random Generation of Strings in a Context-Free Language
Cited in
(only showing first 100 items - show all)- Classifying lattice walks restricted to the quarter plane
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Random generation of combinatorial structures from a uniform distribution
- Random generation of trees and other combinatorial objects
- Uniform random generation of decomposable structures using floating-point arithmetic
- Combinatorial structures and structures for classification
- A parallel algorithm for the generation of a permutation and applications
- Uniform random generation of words of rational languages
- Attribute grammars and automatic complexity analysis
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Object grammars and bijections.
- Patchworks and metablocks enumeration
- Random generation of combinatorial structures -- GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 -- June 4, 2016.
- Taming reluctant random walks in the positive quadrant
- Extended boxed product and application to synchronized trees
- Symmetries of unlabelled planar triangulations
- Mallows and generalized Mallows model for matchings
- On the number of unary-binary tree-like structures with restrictions on the unary height
- Boltzmann samplers for first-order differential specifications
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Generating random binary trees -- a survey
- On the robustness of interconnections in random graphs: a symbolic approach.
- Relax, but don't be too lazy
- From object grammars to ECO systems
- Forbidden subgraphs in connected graphs
- Random and uniform generation of words
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Grammars and clique-width bounds from split decompositions
- Counting phylogenetic networks of level 1 and 2
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
- Statistical properties of lambda terms
- Generating labeled planar graphs uniformly at random
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- A linear algorithm for the random sampling from regular languages
- Generation of RNA pseudoknot structures with topological genus filtration
- Non-uniform random generation of generalized Motzkin paths
- Efficient iteration in admissible combinatorial classes
- On computing the coefficients of bivariate holonomic formal series
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
- Young tableaux with periodic walls: counting with the density method
- Asymptotic enumeration of cographs
- A generic approach for the unranking of labeled combinatorial classes
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- Boltzmann sampling of ordered structures
- On Labeled and Unlabeled Combinatorial Structures
- Average-case analysis of perfect sorting by reversals
- Random deterministic automata
- An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Uniform random sampling of planar graphs in linear time
- Random Generation for Finitely Ambiguous Context-free Languages
- scientific article; zbMATH DE number 2127730 (Why is no real title available?)
- Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
- scientific article; zbMATH DE number 3864523 (Why is no real title available?)
- Probabilistic models for pattern statistics
- Iterating Through Labelled Combinatorial Structures
- Generating random combinatorial objects
- Average Value and Variance of Pattern Statistics in Rational Models
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
- The degree sequence of random graphs from subcritical classes
- Random Sampling of Plane Partitions
- Generating, sampling and counting subclasses of regular tree languages
- scientific article; zbMATH DE number 3978386 (Why is no real title available?)
- scientific article; zbMATH DE number 1375603 (Why is no real title available?)
- Enumerative encoding of correlation-immune Boolean functions
- Reconstructing convex matrices by integer programming approaches
- Boltzmann samplers for \(v\)-balanced cycles
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- Non-redundant random generation algorithms for weighted context-free grammars
- Sampling different kinds of acyclic automata using Markov chains
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- scientific article; zbMATH DE number 1504592 (Why is no real title available?)
- Automatic discovery of structural rules of permutation classes
- Counting, Generating, Analyzing and Sampling Tree Alignments
- scientific article; zbMATH DE number 2086647 (Why is no real title available?)
- Statistical properties of subgroups of free groups.
- On the enumeration of closures and environments with an application to random generation
- Counting environments and closures
- Beyond series-parallel concurrent systems: the case of arch processes
- Quantitative and algorithmic aspects of barrier synchronization in concurrency
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Boltzmann sampling of unlabelled structures
- Linear-time generation of inhomogeneous random directed walks
- Random generation of deterministic acyclic automata using Markov chains
- An algorithm computing combinatorial specifications of permutation classes
- Formulae and asymptotics for coefficients of algebraic functions
- Generating constrained random data with uniform distribution
- Structural Statistical Software Testing with Active Learning in a Graph
- scientific article; zbMATH DE number 4187108 (Why is no real title available?)
- Sachdev–Ye–Kitaev model with an extra diagonal perturbation: phase transition in the eigenvalue spectrum
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Schröder's paths and random hierarchies
- Exact-Size Sampling of Enriched Trees in Linear Time
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees
- The Combinatorics of Barrier Synchronization
- Update on the asymptotic optimality of LPT
- Holonomic equations and efficient random generation of binary trees
- Random generation of subgroups of the modular group with a fixed isomorphism type
This page was built for publication: A calculus for the random generation of labelled combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334654)
