Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

DOI10.1307/MMJ/1030132713zbMATH Open0998.60069arXivmath/0401318OpenAlexW2036804629MaRDI QIDQ5954556FDOQ5954556

Authors: Persi Diaconis, Arun Ram 

Publication date: 4 February 2002

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Abstract: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

Full work available at URL: https://arxiv.org/abs/math/0401318

Recommendations

• Random walks on the BMW monoid: an algebraic approach
• Hypergroup deformations and Markov chains
• Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution
• On random- and systematic-scan samplers
• A Markov chain on the symmetric group and Jack symmetric functions

zbMATH Keywords

convergence ratestationary distributiontotal variation normfinite Coxeter groupMallows modelsshort and long systematic scan

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Hecke algebras and their representations (20C08)

Cited In (45)

• Thermodynamic limit for the Mallows model on \(S_n\)
• Lengths of monotone subsequences in a Mallows permutation
• Mallows permutations and finite dependence
• Fast mixing of a randomized shift-register Markov chain
• Lumpings of algebraic Markov chains arise from subquotients
• Hopf algebras and Markov chains: two examples and a theory
• Regenerative random permutations of integers
• Cutoff profile of the metropolis biased card shuffling
• Limit theorems for longest monotone subsequences in random Mallows permutations
• Time inhomogeneous Markov chains with wave-like behavior
• The two-sided infinite extension of the Mallows model for random permutations
• On the cycle structure of Mallows permutations
• Hypergroup deformations and Markov chains
• Double coset Markov chains
• On adding a list of numbers (and other one-dependent determinantal processes)
• A central limit theorem for descents of a Mallows permutation and its inverse
• Systematic scan for sampling colorings
• Cutoff profile of ASEP on a segment
• Phase uniqueness for the Mallows measure on permutations
• An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
• Cycles in Mallows random permutations
• Statistical enumeration of groups by double cosets
• Mixing time of the card-cyclic-to-random shuffle
• The efficient computation of Fourier transforms on semisimple algebras
• A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings
• Random walks on the BMW monoid: an algebraic approach
• Estimation in exponential families on permutations
• Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials
• The height of Mallows trees
• Some Hecke algebra products and corresponding random walks.
• \(q\)-exchangeability via quasi-invariance
• A probabilistic interpretation of the Macdonald polynomials
• Hit and run as a unifying device
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• The length of the longest increasing subsequence of a random Mallows permutation
• Matrix norms and rapid mixing for spin systems
• Mallows permutations as stable matchings
• The Markov chain Monte Carlo revolution
• On systematic scan for sampling \(H\)-colorings of the path
• Mallows product measure
• Separation cut-offs for birth and death chains
• Some things we've learned (about Markov chain Monte Carlo)
• A geometric interpretation of the Metropolis-Hastings algorithm.
• A differential model for the deformation of the Plancherel growth process
• Sampling and learning Mallows and generalized Mallows models under the Cayley distance

This page was built for publication: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

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