The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
Abstract
During the last two decades, concentration inequalities have been the subject of exciting developments in various areas, including convex geometry, functional analysis, statistical physics, high-dimensional statistics, pure and applied probability theory (e.g., concentration of measure phenomena in random graphs, random matrices, and percolation), information theory, theoretical computer science, and learning theory. This monograph focuses on some of the key modern mathematical tools that are used for the derivation of concentration inequalities, on their links to information theory, and on their various applications to communications and coding. In addition to being a survey, this monograph also includes various new recent results derived by the authors. This monograph focuses on some of the key modern mathematical tools that are used for the derivation of concentration inequalities, on their links to information theory, and on their various applications to communications and coding. In addition to being a survey, this monograph also includes various new recent results derived by the authors. The first part of the monograph introduces classical concentration inequalities for martingales, as well as some recent refinements and extensions. The power and versatility of the martingale approach is exemplified in the context of codes defined on graphs and iterative decoding algorithms, as well as codes for wireless communication. The second part of the monograph introduces the entropy method, an information-theoretic technique for deriving concentration inequalities. The basic ingredients of the entropy method are discussed first in the context of logarithmic Sobolev inequalities, which underlie the so-called functional approach to concentration of measure, and then from a complementary information-theoretic viewpoint based on transportation-cost inequalities and probability in metric spaces. Some representative results on concentration for dependent random variables are briefly summarized, with emphasis on their connections to the entropy method. Finally, we discuss several applications of the entropy method to problems in communications and coding, including strong converses, empirical distributions of good channel codes, and an information-theoretic converse for concentration of measure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probability and Random Processes.
Grimmett, G. R., & Stirzaker, D. R. (2001) · doi:10.1093/oso/9780198572237.001.0001 · Cited by 1,850
On the concentration of the missing mass
Berend, D., & Kontorovich, A. (2013) · Electronic Communications in Probability · doi:10.1214/ecp.v18-2359 · Cited by 110
Cited by
Sason, I., & Verdu, S. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2603151 · Cited by 292
Self-citationAbbe, E., & Sandon, C. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.47 · Cited by 254
Time-uniform, nonparametric, nonasymptotic confidence sequences
Howard, S. R., Ramdas, A., McAuliffe, J., & Sekhon, J. (2021) · The Annals of Statistics · doi:10.1214/20-aos1991 · Cited by 190
Metadata
- Authors
- Raginsky, M., & Sason, I.
- Venue
- Foundations and Trends in Communications and Information Theory
- Publisher
- Emerald
- Published
- 2013-10-23
- Volume
- 10
- Issue
- 1-2
- Pages
- 1-247
- ISSN
- 1567-2190 (ISSN-L)
- 1567-2328
- OpenAlex
- W2141761557
- Cited by
- 180
- References
- 2
- FWCI
- 12.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.