Markov chains generating random permutations and set partitions

DOI10.1016/J.SPA.2024.104483MaRDI QIDQ6635685

Dudley Stark

Publication date: 12 November 2024

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

Chinese restaurant processabsorbing Markov chainprobabilistic combinatoricsFeller coupling

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Cites Work

• Discrete mathematics
• The \(r\)-Stirling numbers
• Poisson process approximations for the Ewens sampling formula
• Logarithmic combinatorial structures: A probabilistic approach
• An asymptotic formula for \(r\)-Bell numbers with real arguments
• The Feller coupling for random derangements
• The $r$-Bell numbers
• Limit Theorems for Combinatorial Structures via Discrete Process Approximations
• On the Probability of Winning with Different Tournament Procedures
• Lessons in Enumerative Combinatorics
• Random permutations and queues
• The magical Ewens sampling formula
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)