FAR EASTERN BRANCH OF THE RUSSIAN ACADEMY OF SCIENCES
INSTITUTE OF APPLIED MATHEMATICS KHABAROVSK DIVISION
Far Eastern Mathematical Journal
Dominant connections in highly reliable two-terminal networks |
Losev A.S. |
2025, issue 1, P. 61-66 DOI: https://doi.org/10.47910/FEMJ202505 |
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. |
Keywords: connectivity, two-terminal network, dominant connections, network structures. |
Download the article (PDF-file) |
References |
| [1] Gnedenko V.B., Matematicheskie metody v teorii nadezhnosti i effektivnosti, Mashinostroenie, M, 1987. [2] Gromov YU.YU., Drachev V.O., Nabatov K.A., Ivanov O.G., Sintez i analiz zhivuchesti setevykh sistem, Mashinostroenie, M, 2007. [3] Ivanova A.P., Mezhueva L.V., Piskareva T.I., Gun'ko V.V., “Dekompozitsionnyi podkhod k nadezhnosti tekhnicheskoi sistemy”, Vestnik OGU, 10, (2011), 280–283. [4] Pavlov I.V., Razgulyaev S.V., “Postroenie doveritel'nykh granits dlya koeffitsientov gotovnosti sistemy s vosstanavlivaemymi elementami”, Vestnik MGTU im. N.E. Baumana. Ser. Estestvennye nauki, 4, (2015), 15–11. [5] Bykova V.V., “O merakh tselostnosti grafov: obzor”, Prikladnaya diskretnaya matematika, 4(26), (2014), 96–111. [6] Serdyukov V.I., Serdyukova N.A., Shishkina S.I., “Povyshenie bezotkaznoi raboty izdelii s ispol'zovaniem elementov iskusstvennogo intellekta”, Vestnik MGTU im. N.E. Baumana. Ser. Mashinostroenie, 1(112), (2017), 62–72. [7] Karavai M.F., “Matematicheskie osnovy otkazoustoichivosti”, Metody i sistemy tekhnicheskoi diagnostiki, 14(1), (1990), 3–7. [8] Karavai M.F., “Primenenie teorii simmetrii k analizu i sintezu otkazoustoichivykh sistem”, Avtomatika i telemekhanika, 6, (1996), 159–173. [9] Losev A.S., “Asimptoticheskii analiz nadezhnosti stokhasticheskikh setei”, Informatika i sistemy upravleniya, 4(18), (2008), 101–105. [10] Tsitsiashvili G.SH., Osipova M.A., Losev A.S., “Asimptoticheskie formuly dlya veroyatnostei svyaznosti sluchainykh grafov”, Avtomatika i vychislitel'naya tekhnika, 2, (2013), 22–28. [11] Ryabinin I. A., Logiko-veroyatnostnye metody issledovaniya nadezhnosti strukturno-slozhnykh sistem, Radio i svyaz', M, 1981. |