摘要

On Barabasi-Albert networks ( BA) and variations as well as on Erdos-Renyi ( ER) random graphs, we study the occurrence of a gap in the neighbor numbers k(i) versus node index i ( with i = 1; 2;...; N) at m = 2, 4, 6, 10, 50, 100 and 150 and with up to N = 1 000 000 nodes. Here, we call "gap" a jump in the neighbor numbers k(i) when i equals the initial number m of neighbors; m is also the number of neighbors randomly selected by a newly added node. The size of the gap depends on the value of m and causes a deformation in the structure k(i) of the networks studied here. We give a systematic investigation of the gap in all types of BA networks known to us, and only the undirected BA ( UBA) network and the ER graphs show no gap for m > 4.

  • 出版日期2017-2