Identifying sufficient statistics in information networks

Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determine information flow at some other parts of the network. We give a simple information theoretic characterization for this problem, which naturally leads to a graph theoretic identifying procedure.