We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the Iwahori-Hecke algebra. 1.
No takes yet. Share an insight, caveat, or question.
Diaconis et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: