Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
From MaRDI portal
Publication:5954556
DOI10.1307/mmj/1030132713zbMath0998.60069arXivmath/0401318OpenAlexW2036804629MaRDI 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 ratestationary distributiontotal variation normfinite Coxeter groupMallows modelsshort and long systematic scan
Central limit and other weak theorems (60F05) Hecke algebras and their representations (20C08) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Fast mixing of a randomized shift-register Markov chain ⋮ On adding a list of numbers (and other one-dependent determinantal processes) ⋮ Cutoff profile of ASEP on a segment ⋮ Statistical enumeration of groups by double cosets ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ The length of the longest increasing subsequence of a random Mallows permutation ⋮ An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings ⋮ Some things we've learned (about Markov chain Monte Carlo) ⋮ Phase uniqueness for the Mallows measure on permutations ⋮ \(q\)-exchangeability via quasi-invariance ⋮ Mallows permutations and finite dependence ⋮ Cycles in Mallows random permutations ⋮ Regenerative random permutations of integers ⋮ Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials ⋮ Cutoff profile of the metropolis biased card shuffling ⋮ Hit and run as a unifying device ⋮ The two-sided infinite extension of the Mallows model for random permutations ⋮ Limit theorems for longest monotone subsequences in random Mallows permutations ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ Time inhomogeneous Markov chains with wave-like behavior ⋮ A geometric interpretation of the Metropolis-Hastings algorithm. ⋮ Hopf algebras and Markov chains: two examples and a theory ⋮ On the cycle structure of Mallows permutations ⋮ A probabilistic interpretation of the Macdonald polynomials ⋮ A differential model for the deformation of the Plancherel growth process ⋮ Estimation in exponential families on permutations ⋮ Thermodynamic limit for the Mallows model on Sn ⋮ Random walks on the BMW monoid: an algebraic approach ⋮ Mixing times of the biased card shuffling and the asymmetric exclusion process ⋮ Systematic scan for sampling colorings ⋮ Some Hecke algebra products and corresponding random walks. ⋮ On systematic scan for sampling H-colorings of the path ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings ⋮ Separation cut-offs for birth and death chains ⋮ The Markov chain Monte Carlo revolution ⋮ Matrix norms and rapid mixing for spin systems ⋮ Mixing time of the card-cyclic-to-random shuffle ⋮ The height of Mallows trees ⋮ Lumpings of algebraic Markov chains arise from subquotients ⋮ Lengths of monotone subsequences in a Mallows permutation ⋮ Mallows permutations as stable matchings ⋮ Double coset Markov chains
