Probabilistic Communication Net as a Nonoriented Graph

This paper proves a necessary and sufficient realizability condition of the s-expected terminal capacity matrix of a probabilistic communication net. The proof is based on the successive reduction processes of a matrix, which provide a technique for designing a tree topology and determing edge capacities and reliabilities that satisfy the matrix.