Abstract:
The paper researches the problem of increasing the probability of disconnection of a two-terminal highly reliable
graph. As a solution, the idea of identifying dominant connections, the numerical characteristics of which form an
asymptotic estimate of the probability of graph connectivity, is proposed. It is proved that changing the throughput of
such connections most significantly affects the probability of disconnection of the entire graph.
Fulltext:
PDF file (115 kB)