Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration (Q2563936): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1214/aop/1039639365
+Normal rank
@@ Property / OpenAlex ID @@
+W1998123258
@@ Property / OpenAlex ID: W1998123258 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on conditional probabilities with applications in multi-user communication
+Normal rank
@@ Property / cites work @@
+A simple proof of the blowing-up lemma (Corresp.)
@@ Property / cites work: A simple proof of the blowing-up lemma (Corresp.) / rank @@
+Normal rank
@@ Property / cites work @@
+The positive-divergence and blowing-up properties
@@ Property / cites work: The positive-divergence and blowing-up properties / rank @@
+Normal rank
@@ Property / cites work @@
+Q3496342
@@ Property / cites work: Q3496342 / rank @@
+Normal rank
@@ Property / cites work @@
+Error exponents for distributed detection of Markov sources
+Normal rank
@@ Property / cites work @@
+Q5329487
@@ Property / cites work: Q5329487 / rank @@
+Normal rank
@@ Property / cites work @@
+Concentration of measure and isoperimetric inequalities in product spaces
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2563936