Pages that link to "Item:Q4210091"
From MaRDI portal
The following pages link to A Chernoff Bound for Random Walks on Expander Graphs (Q4210091):
Displaying 35 items.
- Mixing of the upper triangular matrix walk (Q365712) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- Rigorous confidence bounds for MCMC under a geometric drift condition (Q617654) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Optimal Hoeffding bounds for discrete reversible Markov chains. (Q1879898) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- Occupation measure for random walk on the circle (Q1900168) (← links)
- Cutoff for random walk on dynamical Erdős-Rényi graph (Q2028956) (← links)
- The Littlewood-Offord problem for Markov chains (Q2064822) (← links)
- Random walks on hyperbolic spaces: concentration inequalities and probabilistic Tits alternative (Q2089757) (← links)
- Function-specific mixing times and concentration away from equilibrium (Q2226692) (← links)
- Concentration of Markov chains with bounded moments (Q2227486) (← links)
- Mixing time estimation in reversible Markov chains from a single sample path (Q2330466) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Nonasymptotic bounds on the estimation error of MCMC algorithms (Q2435233) (← links)
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions (Q2491601) (← links)
- DEX: self-healing expanders (Q2629213) (← links)
- A Hoeffding inequality for Markov chains (Q2631808) (← links)
- Finding large expanders in graphs: from topological minors to induced subgraphs (Q2684887) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Tail Estimates for Sums of Variables Sampled by a Random Walk (Q3512608) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- (Q5005182) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
- Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes (Q5176523) (← links)
- Efficient Simulation of High Dimensional Gaussian Vectors (Q5219708) (← links)
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (Q5256387) (← links)
- Fixed Precision MCMC Estimation by Median of Products of Averages (Q5321751) (← links)
- (Q5875519) (← links)
- (Q6062147) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- The Swendsen–Wang dynamics on trees (Q6076210) (← links)
- Distributed protocols against mobile eavesdroppers (Q6084554) (← links)
