Additional Closeness and Networks Growth

Article type: Research Article

Authors: Dangalchev, Chavdar^{; *}

Affiliations: Associate member of the Bulgarian Academy of Sciences, IMI, Sofia, Bulgaria. [email protected]

Correspondence: [*] Address for correspondence: Associate member of the Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Sofia, Bulgaria.

Abstract: 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.

Keywords: Networks generation, Networks growth, Graph vulnerability, Closeness, Residual closeness

DOI: 10.3233/FI-2020-1960

Journal: Fundamenta Informaticae, vol. 176, no. 1, pp. 1-15, 2020