Correction to: ``Speeding up Markov chains with deterministic jumps''
type: Item
instance of: scholarly article
title: Correction to: ``Speeding up Markov chains with deterministic jumps''
zbMATH Open document ID: 1474.60178
author: Sourav Chatterjee
author: Persi Diaconis
publication date: 2021-11-26T00:00:00Z
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J22
zbMATH DE Number: 7434404
MaRDI profile type: Publication
full work available at URL: s00440-021-01049-1
OpenAlex ID: W3196822371
cites work: Hit and run as a unifying device
cites work: Mixing times of random walks on dynamic configuration models
cites work: Qualitative properties of certain piecewise deterministic Markov processes
cites work: Irreducibility of random polynomials of large degree
cites work: Random walks arising in random number generation
cites work: Diffusion and mixing in fluid flow
cites work: Q3995195
cites work: Some things we've learned (about Markov chain Monte Carlo)
cites work: Probabilizing Fibonacci Numbers
cites work: An affine walk on the hypercube
cites work: Binomial coefficient codes over GF(2)
cites work: Analysis of a nonreversible Markov chain sampler.
cites work: On the spectral analysis of second-order Markov chains
cites work: Moderate growth and random walk on finite groups
cites work: Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
cites work: Algebraic algorithms for sampling from conditional distributions
cites work: Sensitivity of mixing times
cites work: Mixing time of the Chung-Diaconis-Graham random process
cites work: Permuted Random Walk Exits Typically in Linear Time
cites work: Improved mixing rates of directed cycles by added connection
cites work: A Model for Random Random-Walks on Finite Groups
cites work: Exceptional polynomials of affine type
cites work: On sensitivity of uniform mixing times
cites work: On sensitivity of mixing times and cutoff
cites work: A survey of results on random random walks on finite groups
cites work: A lower bound for the Chung-Diaconis-Graham random process
cites work: Cutoff on all Ramanujan graphs
cites work: Cutoff phenomena for random walks on random regular graphs
cites work: Some simple but challenging Markov processes
cites work: Q4692511
cites work: A permuted random walk exits faster
cites work: Random random walks on \(\mathbb{Z}_2^d\)
DOI: 10.1007/S00440-021-01049-1
published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
description: scientific article; zbMATH DE number 7434404