The Littlewood-Offord problem for Markov chains

DOI10.1214/21-ECP410zbMath1479.60063arXiv1904.13019OpenAlexW3183366696MaRDI QIDQ2064822

Shravas Rao

Publication date: 6 January 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.13019

zbMATH Keywords

Markov chainpseudorandom generatorLittlewood-Offord

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Large deviations (60F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Stronger form of an M-part Sperner theorem
• A Sperner-type theorem
• Ramanujan graphs
• Solution of the Littlewood-Offord problem in high dimensions
• Chernoff-type bound for finite Markov chains
• Optimal Hoeffding bounds for discrete reversible Markov chains.
• Concentration of Markov chains with bounded moments
• The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
• On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
• Estimates for the concentration function of combinatorial number theory and probability
• A Chernoff Bound for Random Walks on Expander Graphs
• A polynomial restriction lemma with applications
• Über ein Problem von Erdös und Moser
• A simple proof of Stirling's formula for the gamma function
• On the Kolmogorov-Rogozin inequality for the concentration function
• On a lemma of Littlewood and Offord

This page was built for publication: The Littlewood-Offord problem for Markov chains