Abstract
Known asymptotic formulas are used to analyze the connectivity probability of graphs with highly reliable and poorly reliable edges. The conventional methods used to calculate the coefficients in these formulas require a number of arithmetic operations that grows geometrically with the growing number of graph edges. The adjacency matrix of the dual graph for highly reliable edges and the Kirchhoff matrix for poorly reliable edges result in algorithms of cubic complexity.
Similar content being viewed by others
References
Lomonosov, M.V. and Polesskii, V.P., Higher boundary of information networks safety, Probl. Peredachi Inf., 1971, vol. 7, no. 4, pp. 78–81.
Lomonosov, M.V. and Polesskii, V.P., Lower estimation of networks safety, Probl. Peredachi Inf., 1972, vol. 8, no. 2, pp. 47–53.
Tanguy, C., What is the probability of connecting two points? J. Phys. A: Math. Theor., 2007, vol. 40, pp. 14099–14116.
Solozhentsev, E.D., Stsenarnoe logiko-veroyatnostnoe upravlenie riskom v biznese i ekonomike (Scenary Logic-Probability Management of Risk in Business and Economics), St. Petersburg: Biznes-pressa, 2006.
Rodionova, O.K., Rodionov, A.S., and Choo, H.O., Network Probabilistic Connectivity Exact Calculation with Use of Chains, Springer LNCS, 2004, vol. 3046, pp. 315–324.
Gertsbakh, I. and Shpungin, Y., Models of Network Reliability. Analysis, Combinatorics and Monte-Carlo CRC Press. Taylor and Francis Group, 2010.
Burtin, Yu. and Pittel’, B., Asymptotic estimation of complex system safety, Tekhn. Kibern., 1972, vol. 10, no. 3, pp. 90–96.
Whithney, H., Nonseparable and planar graphs, Trans. Am. Math. Soc., 1932, vol. 34, pp. 339–362.
Harary, F., Graph Theory, Reading, MA: Addison-Wesley, 1969.
Prasolov, V.V., Elementy kombinatornoi i differentsial’noi topologii (Elements of Combinatorial and Differential Topology), Moscow: MTsNMO, 2004.
Chebotarev, P.Yu. and Shamis, E.V., The matrix-forest theorem and measuring relations in small social group, Autom. Remote Contr., 1997, vol. 58, pp. 1505–1514.
Il’in, V.A. and Poznyak, E.G., Lineinaya algebra (Linear Algebra), Moscow: FIZMATLIT, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © G.Sh. Tsitsiashvili, A.S. Losev, M.A. Osipova, 2013, published in Avtomatika i Vychislitel’naya Tekhnika, 2013, No. 2, pp. 22–28.
About this article
Cite this article
Tsitsiashvili, G.S., Losev, A.S. & Osipova, M.A. Asymptotic formulas for connectivity probabilities of random graphs. Aut. Control Comp. Sci. 47, 70–74 (2013). https://doi.org/10.3103/S0146411613020090
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613020090