When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence (Q2070641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence |
scientific article |
Statements
When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence (English)
0 references
24 January 2022
0 references
concentration inequalities
0 references
dependency graphs
0 references
0 references
0 references
0.8428443
0 references
0 references
0.8390657
0 references
0.83794475
0 references
0.83732176
0 references
0.8347571
0 references
0.8344515
0 references
0.83390325
0 references
0 references
