A Dispersion Theorem for Communication Networks Based on Term Sets
Traditionally, communication networks are modeled and analyzed in terms of information flows in graphs. In this paper, the authors introduce a new symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms. To any choice of coding functions they associate a measure of performance, referred to as the dispersion. Many communication problems can be recast as dispersion problems in this setup. They state and prove variants of a theorem concerning dispersion of information in communication networks which generalizes the network coding theorem.