Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
From MaRDI portal
Publication:5954556
DOI10.1307/mmj/1030132713zbMath0998.60069arXivmath/0401318MaRDI QIDQ5954556
Publication date: 4 February 2002
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0401318
convergence rate; stationary distribution; total variation norm; finite Coxeter group; Mallows models; short and long systematic scan
60F05: Central limit and other weak theorems
20C08: Hecke algebras and their representations
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Related Items
Mixing times of the biased card shuffling and the asymmetric exclusion process, A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings, The length of the longest increasing subsequence of a random Mallows permutation, Some things we've learned (about Markov chain Monte Carlo), The two-sided infinite extension of the Mallows model for random permutations, \(q\)-exchangeability via quasi-invariance, A probabilistic interpretation of the Macdonald polynomials, Separation cut-offs for birth and death chains, Matrix norms and rapid mixing for spin systems, A geometric interpretation of the Metropolis-Hastings algorithm., Time inhomogeneous Markov chains with wave-like behavior, Some Hecke algebra products and corresponding random walks., A differential model for the deformation of the Plancherel growth process, Systematic scan for sampling colorings, On systematic scan for sampling H-colorings of the path, On adding a list of numbers (and other one-dependent determinantal processes), Thermodynamic limit for the Mallows model on Sn, The Markov chain Monte Carlo revolution
