On Reduction as a Tool for Information Theory

Michelle Effros
Professor, Caltech
Given on: April. 19th, 2013


The expansion of information theory from the study of very small networks to the understanding of extremely large networks is often viewed as both critically important and insurmountably difficult. Nonetheless, many general properties of large networks can be derived using very simple tools. This talk focuses on a reduction strategy borrowed from CS theory, exploring a few simple applications and their implications for understanding the nature of noise, the impact of dependence, and the consequences of delay for reliable communications in large (and small) communication networks.