Markov chains generating random permutations and set partitions
From MaRDI portal
Recommendations
- Random permutation graphs and related Markov chains
- Random permutations and queues
- The Feller coupling for random derangements
- Reversible Markov structures on divisible set partitions
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
Cites work
- An asymptotic formula for \(r\)-Bell numbers with real arguments
- Discrete mathematics
- scientific article; zbMATH DE number 997340 (Why is no real title available?)
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 3933776 (Why is no real title available?)
- scientific article; zbMATH DE number 3666810 (Why is no real title available?)
- scientific article; zbMATH DE number 3687385 (Why is no real title available?)
- Lessons in enumerative combinatorics
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- Logarithmic combinatorial structures: A probabilistic approach
- On the Probability of Winning with Different Tournament Procedures
- Poisson process approximations for the Ewens sampling formula
- Random permutations and queues
- Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
- The r-Bell numbers
- The \(r\)-Stirling numbers
- The Feller coupling for random derangements
- The magical Ewens sampling formula
Cited in
(3)
This page was built for publication: Markov chains generating random permutations and set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635685)