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.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
One of the most sensitive characteristics of network vulnerability is residual closeness. Calculating the closeness and the residual closeness of larger graphs is a time consuming and operations heavy process. In this article, we try to mitigate the process for thorn graphs-we present the thorn graphs residual closeness as a function of the closeness and the residual closeness of the original graphs.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.