scientific article; zbMATH DE number 7758305
From MaRDI portal
Publication:6084346
DOI10.4230/LIPICS.APPROX/RANDOM.2020.3arXiv1910.05184MaRDI QIDQ6084346
Amanda Pascoe Streib, Noah Streib, Sarah Miracle
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/1910.05184
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Mixing times of Markov chains for self‐organizing lists and biased permutations ⋮ Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral gap for open Jackson networks
- Mixing time of critical Ising model on trees is polynomial in the height
- Trailing the dovetail shuffle to its lair
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- Mixing times of lozenge tiling and card shuffling Markov chains
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Markov chain decomposition for convergence rate analysis
- Rapid mixing of \(k\)-class biased permutations
- Elementary bounds on mixing times for decomposable Markov chains
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids
- Analyzing Glauber dynamics by comparison of Markov chains
- Pseudorandomness
- An interlacing theorem for reversible Markov chains
- Generating a random permutation with random transpositions
- On self-organizing sequential search heuristics
- Bounding spectral gaps of Markov chains: a novel exact multi-decomposition technique
- Mixing of Permutations by Biased Transposition
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Cluster Algorithms for Discrete Models of Colloids with Bars
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
This page was built for publication:
