Abstract
A channel graph is a directed acyclic graph with a unique source vertex and a unique sink vertex, in which all edges are partitioned into stages according to their distance from the source. Edges cannot vertices in consecutive stages only. The blocking probability of a channel graph is the probability that every source to sink path is blocked. A general transformation is developed that never decreses the blocking probability. This transformation leads to a short proof of a generalization of a theorem of Takagi,and a theorem of Chung and Hwang, in the case of the binomial model.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 664-666 |
| Number of pages | 3 |
| Journal | IEEE Transactions on Communications |
| Volume | 41 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 1993 |
| Externally published | Yes |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Transformations on Channel Graphs'. Together they form a unique fingerprint.
Cite this
Kraetzl, M., & Colbourn, C. J. (1993). Transformations on Channel Graphs. IEEE Transactions on Communications, 41(5), 664-666. https://doi.org/10.1109/26.225478