Generalized cut-set bounds for networks with collocated messages

This paper considers classical networks with collocated multicast messages and more than three sink nodes. A new class of information-theoretic upper bounds on the achievable rates is established, generalizing the standard cut-set bounds. These new bounds involve three basic cuts of the network and are established only via the submodularity of the entropy function.