Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
From MaRDI portal
(Redirected from Publication:5954556)
Abstract: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
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
Cited in
(55)- Matrix norms and rapid mixing for spin systems
- Hypergroup deformations and Markov chains
- A geometric interpretation of the Metropolis-Hastings algorithm.
- Limit theorems for longest monotone subsequences in random Mallows permutations
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- On the cycle structure of Mallows permutations
- The efficient computation of Fourier transforms on semisimple algebras
- Time inhomogeneous Markov chains with wave-like behavior
- Random walks on the BMW monoid: an algebraic approach
- The height of Mallows trees
- 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
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
- Mallows permutations and finite dependence
- Hit and run as a unifying device
- Some Hecke algebra products and corresponding random walks.
- Lumpings of algebraic Markov chains arise from subquotients
- Lengths of monotone subsequences in a Mallows permutation
- Regenerative random permutations of integers
- Hopf algebras and Markov chains: two examples and a theory
- 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)
- The length of the longest increasing subsequence of a random Mallows permutation
- Thermodynamic limit for the Mallows model on S_n
- The Markov chain Monte Carlo revolution
- Some things we've learned (about Markov chain Monte Carlo)
- The two-sided infinite extension of the Mallows model for random permutations
- Phase uniqueness for the Mallows measure on permutations
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Mallows permutations as stable matchings
- A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings
- Double coset Markov chains
- Fast mixing of a randomized shift-register Markov chain
- Cycles in Mallows random permutations
- q-exchangeability via quasi-invariance
- Cutoff profile of the metropolis biased card shuffling
- Mallows product measure
- Classical patterns in Mallows permutations
- Logical limit laws for Mallows random permutations
- A central limit theorem on two-sided descents of Mallows distributed elements of finite Coxeter groups
- Expanderizing higher-order random walks
- A probabilistic interpretation of the Macdonald polynomials
- Expanderizing higher-order random walks
- The global and local limit of the continuous-time Mallows process
- Tangled paths: a random graph model from Mallows permutations
- Tangled paths: a random graph model from Mallows permutations (extended abstract)
- Estimation in exponential families on permutations
- Six-vertex model with rare corners and random restricted permutations
- From continuous to discrete: a No-U-Turn Sampler for permutations
- Mixing time of the card-cyclic-to-random shuffle
- Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials
- Separation cut-offs for birth and death chains
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)
