Dominant connections in highly reliable two-terminal networks
Dal'nevostochnyi Matematicheskii Zhurnal · 16.06.2025 · 25 (1) · 61-66
DOI: 10.47910/femj202505 ↗Kurz gefasst
Fachartikel in der Zeitschrift Dal'nevostochnyi Matematicheskii Zhurnal, erschienen am 16.06.2025. Verfasst von A.S. Losev.
Abstract (Originalsprache)
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.
Zitieren
APA
Losev, A. (2025). Dominant connections in highly reliable two-terminal networks. Dal'nevostochnyi Matematicheskii Zhurnal, 25(1), 61-66. https://doi.org/10.47910/femj202505
Vancouver
Losev A. Dominant connections in highly reliable two-terminal networks. Dal'nevostochnyi Matematicheskii Zhurnal. 2025;25(1):61-66. doi:10.47910/femj202505
BibTeX
@article{Losev2025,
author = {Losev, A.S.},
title = {Dominant connections in highly reliable two-terminal networks},
journal = {Dal'nevostochnyi Matematicheskii Zhurnal},
year = {2025},
volume = {25},
number = {1},
pages = {61--66},
doi = {10.47910/femj202505}
}
EUVIMED