Additional Closeness and Networks Growth

• Autorzy: Dangalchev Chavdar

Identyfikatory

DOI

10.3233/FI-2020-1960

• Języki publikacji: EN

Abstrakty

EN

Creation and growth are very important in network analysis. In this article we propose one possible model for networks generation. The probabilities of new links are proportional to the expected closeness of the added node. We also propose a new characteristic of graphs - additional closeness, which measures the maximal closeness of a graph after adding a new link. Some properties of the additional closeness are explored. Three different ways of joining two networks are investigated.

Słowa kluczowe

EN

network generation; networks growth; graph vulnerability; closeness; residual closeness

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2020
• Tom: Vol. 176, nr 1
• Strony: 1--15
• Opis fizyczny: Bibliogr. 17 poz., rys., wykr.

Twórcy

autor

Dangalchev Chavdar

• Associate member of the Bulgarian Academy of Sciences, IMI, Sofia, Bulgaria

Bibliografia

• [1] Erdös P., Renyi A. Publ. Math. Inst. Hung. Acad. Sci. 1960; 5:17.
• [2] Watts D.J., Strogatz S.H. Collective dynamics of small-world networks. Nature. 1998; 393:440. URL https://doi.org/10.1038/30918.
• [3] Barabasi A.-L., Albert R., Jeong H. Mean-field theory for scale-free random networks. Physica A. 1999; 272:173. URL https://doi.org/10.1016/S0378-4371(99)00291-5.
• [4] Dangalchev Ch. Residual closeness in networks. Phisica A. 2006; 365:556-564.
• [5] Dangalchev Ch. Residual closeness and generalized closeness. IJFCS. 2011;22(8):1939-1947. doi:10.1016/j.physa.2005.12.020.
• [6] Aytac A, Odabas Z.N. Residual closeness of wheels and related networks. IJFCS 2011;22(5):1229-1240. URL https://doi.org/10.1142/S0129054111008660.
• [7] Odabas Z.N, Aytac A. Residual closeness in cycles and related networks. Fundamenta Informaticae. 2013;124 (3): 297-307. doi:10.3233/FI-2013-835.
• [8] Turaci T, Okten M. Vulnerability of Mycielski graphs via residual closeness, Ars Combinatoria. 2015; 118: 419-427.
• [9] Aytac A, Berberler Z.N.O. Robustness of Regular Caterpillars. IJFCS. 2017; 28(7): 835-841. URL https://doi.org/10.1142/S0129054117500277.
• [10] Aytac A, Odabas Z.N. Network robustness and residual closeness. RAIRO-Operations Research. 2017. URL https://doi.org/10.1051/ro/2016071.
• [11] Turaci T, Aytac V. Residual Closeness of Splitting Graphs. Ars Combinatoria. 2017; 130: 17-27.
• [12] Aytac A, Berberler, Z.N.O. Residual Closeness for Helm and sunflower graphs. TWMS Journal of applied and Engineering Mathematics. 2017; 7(2), 209-220.
• [13] Dangalchev Ch. Residual Closeness of Generalized Thorn Graphs. Fundamenta Informaticae. 2018;162(1), 2018, p 1-15. di: 10.3233/FI-2018-1710.
• [14] Aytac V, Turaci T. Closeness centrality in some splitting networks. Computer Science Journal of Moldova. 2018;26(3):251-269. ID: 57760763.
• [15] Berberler ZN, Yigit E. Link Vulnerability in Networks. IJFCS. 2018; 29(03):447-456. URL https://doi.org/10.1142/S0129054118500077.
• [16] Rupnik D, Žerovnik J. Networks with Extremal Closeness. Fundamenta Informaticae. 2019; 167(3):219-234. doi:10.3233/FI-2019-1815.
• [17] Dangalchev Ch. Closeness of Splitting Graphs. C.R. Acad. Bulg. Sci. 2020; 73(4): 461-466.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).