The dual Burnside process

DOI10.1007/S10959-026-01539-9MaRDI QIDQ7347246zbMATH OpenFDO

Authors Ivan Z. Feng

Publication date 14 September 2026

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10959-026-01539-9

Mathematics Subject Classification ID

Partitions of sets (05A18) Group actions on combinatorial structures (05E18) Symmetric groups (20B30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Cites work

• Analysis of a Bose-Einstein Markov chain
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Cycle indices for the finite classical groups
• Geometric bounds for eigenvalues of Markov chains
• Gibbs sampling, exponential families and orthogonal polynomials
• Hahn polynomials and the Burnside process
• scientific article; zbMATH DE number 475376 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Mixing times for the commuting chain on CA groups
• Parking functions and noncrossing partitions
• Random sampling of contingency tables and partitions: two practical examples of the Burnside process
• The ‘Burnside Process’ Converges Slowly

This page was built for publication: The dual Burnside process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347246)