Impact of topology on interference networks with no CSIT

We study the symmetric degrees-of-freedom (DoF) of partially connected K-user interference networks in which the transmitters are unaware of the actual channel gain values. Several linear algebraic and graph theoretic concepts are introduced to derive new outer and inner bounds on the symmetric DoF for arbitrary network topologies. We evaluate the bounds for a class of networks, showing that the bounds are tight for most topologies in that class, and we also quantify the gains obtained over benchmark schemes.