Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration (Q2563936): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Bounds on conditional probabilities with applications in multi-user communication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple proof of the blowing-up lemma (Corresp.) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The positive-divergence and blowing-up properties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3496342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Error exponents for distributed detection of Markov sources / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5329487 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concentration of measure and isoperimetric inequalities in product spaces / rank | |||
Normal rank |
Revision as of 10:00, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration |
scientific article |
Statements
Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration (English)
0 references
20 February 1997
0 references
measure concentration
0 references
isoperimetric inequality
0 references
Markov chains
0 references
\(\overline d\)-distance
0 references
informational divergence
0 references