When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
From MaRDI portal
Publication:2070641
DOI10.1016/j.spl.2021.109272zbMath1478.60095arXiv2110.05374OpenAlexW3206825499MaRDI QIDQ2070641
Publication date: 24 January 2022
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.05374
Inequalities; stochastic orderings (60E15) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Stationary stochastic processes (60G10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On normal approximations of distributions in terms of dependency graphs
- Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
- Poisson approximation for dependent trials
- On 1-dependent processes and \(k\)-block factors
- Concentration of measure inequalities for Markov chains and \(\Phi\)-mixing processes.
- Normal approximation under local dependence.
- Concentration of measure without independence: a unified approach via the martingale method
- Concentration inequalities for Markov chains by Marton couplings and spectral methods
- Concentration inequalities for dependent random variables via the martingale method
- The central limit theorem for dependent random variables
- Poisson approximation for large deviations
- Measure concentration and strong mixing
- Large deviations for sums of partly dependent random variables
- Extreme value theory for triangular arrays of dependent random variables
- The Central Limit Theorem for a Sequence of Random Variables with a Slowly Growing Number of Dependences
This page was built for publication: When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
