Markov chains on finite fields with deterministic jumps
From MaRDI portal
Publication:2119672
DOI10.1214/22-EJP757zbMath1486.60092arXiv2010.10668OpenAlexW4214743824MaRDI QIDQ2119672
Publication date: 30 March 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.10668
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Exponential sums (11T23) Random walks on graphs (05C81)
Related Items
On a girth-free variant of the Bourgain-Gamburd machine ⋮ On the multiplicative Chung-Diaconis-Graham process ⋮ Mixing time of fractional random walk on finite fields ⋮ Accelerating abelian random walks with hyperbolic dynamics
Cites Work
- Unnamed Item
- Functional graphs of polynomials over finite fields
- Random walks arising in random number generation
- On the iteration of certain quadratic maps over GF(\(p\)).
- Laplacians and the Cheeger inequality for directed graphs
- Spectral gap of sparse bistochastic matrices with exchangeable rows
- Universality of cutoff for graphs with an added random matching
- The-square-and-add Markov chain
- Speeding up Markov chains with deterministic jumps
- On a lower bound for the Chung-Diaconis-Graham random process
- On the Chung-Diaconis-Graham random process
- Mixing time of the Chung-Diaconis-Graham random process
- Burgess’s Bounds for Character Sums
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Mathematical Aspects of Mixing Times in Markov Chains
- A lower bound for the Chung-Diaconis-Graham random process
- Diameters and Eigenvalues
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
- INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS
- EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS
