A calculus for the random generation of labelled combinatorial structures
From MaRDI portal
binary treeshierarchiesrandom generationset partitionsCayley treesfunctional graphscycle decomposition of permutationslabelled combinatorial objects
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
Cites work
- 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?)
- A Recurrence Related to Trees
- A method and two algorithms on the theory of partitions
- Automatic average-case analysis of algorithms
- 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)- scientific article; zbMATH DE number 3978386 (Why is no real title available?)
- Asymptotic enumeration of cographs
- Generation of RNA pseudoknot structures with topological genus filtration
- Random deterministic automata
- Average-case analysis of perfect sorting by reversals
- Schröder's paths and random hierarchies
- From object grammars to ECO systems
- scientific article; zbMATH DE number 1375603 (Why is no real title available?)
- 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
- Classifying lattice walks restricted to the quarter plane
- scientific article; zbMATH DE number 3864523 (Why is no real title available?)
- Uniform random generation of words of rational languages
- Random generation of words in an algebraic language in linear binary space
- Non-uniform random generation of generalized Motzkin paths
- Boltzmann samplers for first-order differential specifications
- Efficient iteration in admissible combinatorial classes
- Random Sampling of Plane Partitions
- Forbidden subgraphs in connected graphs
- Uniform random generation of decomposable structures using floating-point arithmetic
- scientific article; zbMATH DE number 7524075 (Why is no real title available?)
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Random generation of deterministic acyclic automata using Markov chains
- Attribute grammars and automatic complexity analysis
- Boltzmann sampling of ordered structures
- Generating labeled planar graphs uniformly at random
- Boltzmann sampling of unlabelled structures
- Controlled non-uniform random generation of decomposable structures
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Generating random combinatorial objects
- Probabilistic models for pattern statistics
- Sampling different kinds of acyclic automata using Markov chains
- Relax, but don't be too lazy
- Random generation of combinatorial structures from a uniform distribution
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Efficient random sampling of binary and unary-binary trees via holonomic equations
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
- Formulae and asymptotics for coefficients of algebraic functions
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Combinatorial structures and structures for classification
- On Labeled and Unlabeled Combinatorial Structures
- An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
- scientific article; zbMATH DE number 1504592 (Why is no real title available?)
- Enumerative encoding of correlation-immune Boolean functions
- Reconstructing convex matrices by integer programming approaches
- Random Generation for Finitely Ambiguous Context-free Languages
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- Counting and generating permutations in regular classes
- Enumeration and random generation of accessible automata
- The degree sequence of random graphs from subcritical classes
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Simulating the component counts of combinatorial structures
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets
- scientific article; zbMATH DE number 2086647 (Why is no real title available?)
- Counting, Generating, Analyzing and Sampling Tree Alignments
- Symmetries of unlabelled planar triangulations
- Families of prudent self-avoiding walks
- Generating, sampling and counting subclasses of regular tree languages
- A linear algorithm for the random sampling from regular languages
- Uniform random sampling of planar graphs in linear time
- A parallel algorithm for the generation of a permutation and applications
- An algorithm computing combinatorial specifications of permutation classes
- A generic approach for the unranking of labeled combinatorial classes
- A linear-time algorithm for the generation of trees
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- On computing the coefficients of bivariate holonomic formal series
- Random generation of trees and other combinatorial objects
- Object grammars and bijections.
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
- scientific article; zbMATH DE number 4187108 (Why is no real title available?)
- Linear-time generation of inhomogeneous random directed walks
- On the enumeration of closures and environments with an application to random generation
- Statistical properties of lambda terms
- Generating constrained random data with uniform distribution
- Update on the asymptotic optimality of LPT
- Sachdev–Ye–Kitaev model with an extra diagonal perturbation: phase transition in the eigenvalue spectrum
- Random and uniform generation of words
- On the number of unary-binary tree-like structures with restrictions on the unary height
- Extended boxed product and application to synchronized trees
- Taming reluctant random walks in the positive quadrant
- Beyond series-parallel concurrent systems: the case of arch processes
- Structural Statistical Software Testing with Active Learning in a Graph
- The Combinatorics of Barrier Synchronization
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Generating random binary trees -- a survey
- On the robustness of interconnections in random graphs: a symbolic approach.
- Statistical properties of subgroups of free groups.
- Exact-Size Sampling of Enriched Trees in Linear Time
- Random generation of combinatorial structures -- GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 -- June 4, 2016.
- Automatic discovery of structural rules of permutation classes
- Counting phylogenetic networks of level 1 and 2
- Young tableaux with periodic walls: counting with the density method
- Grammars and clique-width bounds from split decompositions
- Holonomic equations and efficient random generation of binary trees
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)
