Prerequisites & Notation

Before You Begin

Chapter 2 re-expresses the three challenges of Chapter 1 in the formal language of network information theory. The mathematical prerequisites are modest but concrete β€” most notably entropy, mutual information, and conditional entropy for discrete sources. Readers who are fluent with Book ITA Chapters 1–3 can proceed directly; others may want to refresh before tackling Section 2.3's converse argument.

  • Entropy, joint entropy, conditional entropy(Review ch01)

    Self-check: Can you write the chain rule H(X,Y)=H(X)+H(Y∣X)H(X, Y) = H(X) + H(Y \mid X)?

  • Mutual information I(X;Y)=H(X)βˆ’H(X∣Y)I(X;Y) = H(X) - H(X \mid Y)(Review ch01)

    Self-check: Why is I(X;Y)β‰₯0I(X;Y) \geq 0?

  • Data processing inequality(Review ch01)

    Self-check: For Xβ†’Yβ†’ZX \to Y \to Z, why does I(X;Z)≀I(X;Y)I(X; Z) \leq I(X; Y)?

  • Cut-set bound for multi-terminal networks(Review ch21)

    Self-check: Can you state the cut-set bound for a three-node relay network?

  • Chapter 1 of this book β€” MapReduce, stragglers, distributed SGD(Review ch01)

    Self-check: Can you state the computation load ΞΌ\mu and communication load Ξ”\Delta informally?

Notation for This Chapter

Chapter 2 is where we formalize the information-theoretic objects that will reappear throughout the book. Keep this table close while reading Sections 2.2–2.4.

SymbolMeaningIntroduced
D\mathcal{D}Input dataset as a random variable (uniform over its support)s01
Dk\mathcal{D}_kPortion of D\mathcal{D} stored at worker kks01
NNNumber of workerss01
YYOutput of the distributed computation (scalar or vector)s01
XkX_kMessage transmitted by worker kk (output of its local encoder)s01
μ\muNormalized per-worker storage: ∣Dk∣/∣D∣|\mathcal{D}_k|/|\mathcal{D}|s02
Ξ”\DeltaNormalized total communication load (bits / intermediate-file size)s02
KKRecovery threshold: any KK responses suffices02
RcompR_{\text{comp}}, RcommR_{\text{comm}}Computation and communication rates (bits per input sample)s02
H(β‹…)H(\cdot)Shannon entropys03
I(β‹…;β‹…)I(\cdot;\cdot)Mutual informations03