In a communication channel, $\{ X_i \}_{i=1}^n$ are inputs and $\{ Y_i \}_{i=1}^n$ are the corresponding outputs.

We represent the dependency relations by a graph with $2n$ nodes (one for each $X_i$ and for each $Y_i$), where there is a directed edge whenever there is a dependency. See the examples in the figures below.

[Figure 1][1]

[Figure 2][2]

[Figure 3][3]

Call this graph the *dependency graph* of the channel.

My question is: **Are there works in the literature where channel capacity or other quantities of the channel are studied in connection with the properties of its dependency graph?**


  [1]: https://i.sstatic.net/TM3sl1XJ.png
  [2]: https://i.sstatic.net/pBPyRUBf.png
  [3]: https://i.sstatic.net/6O3n30BM.png