  Characterising the capacity region for a network can be extremely difficult,
especially when the sources are dependent. Most existing computable outer
bounds are relaxations of the Linear Programming bound. One main challenge to
extend linear program bounds to the case of correlated sources is the
difficulty (or impossibility) of characterising arbitrary dependencies via
entropy functions. This paper tackles the problem by addressing how to use
entropy functions to characterise correlation among sources.
