Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
From MaRDI portal
Publication:2312684
DOI10.1007/s00440-018-0872-7zbMath1481.60138arXiv1706.00310OpenAlexW2964121456WikidataQ129245971 ScholiaQ129245971MaRDI QIDQ2312684
Publication date: 17 July 2019
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.00310
Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items (2)
Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Mixing time bounds for edge flipping on regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can extra updates delay mixing?
- A rule of thumb for riffle shuffling
- Stochastic rearrangement rules for self-organizing data structures
- Functions of random walks on hyperplane arrangements
- Trailing the dovetail shuffle to its lair
- Random walks and hyperplane arrangements
- Semigroups, rings, and Markov chains
- An exact formula for the move-to-front rule for self-organizing lists
- Mixing time for the Ising model: a uniform lower bound for all graphs
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- The heaps process, libraries, and size-biased permutations
- On the matrix occurring in a linear search problem
- The collector's problem with group drawings
- Shuffling Cards and Stopping Times
- Information Loss in Riffle Shuffling
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- The cutoff phenomenon in finite Markov chains.
- Speed and concentration of the covering time for structured coupon collectors
This page was built for publication: Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
