Abstract
In this paper, we propose a novel neighbor-preferential growth (NPG) network model. Theoretical analysis and numerical simulations indicate the new model can reproduce not only a scale-free degree distribution and its power exponent is related to the edge-adding number m, but also a small-world effect which has large clustering coefficient and small average path length. Interestingly, the clustering coefficient of the model is close to that of globally coupled network, and the average path length is close to that of star coupled network. Meanwhile, the synchronizability of the NPG model is much stronger than that of BA scale-free network, even stronger than that of synchronization-optimal growth network.
Highlights
In the past two decades, complex networks have been extensively studied and have gained rich research results
Theoretical analysis and numerical simulations indicate the new model can reproduce a scale-free degree distribution and its power exponent is related to the edge-adding number m, and a small-world effect which has large clustering coefficient and small average path length
Theoretical analysis and numerical simulations indicate the new network is a scale-free network whose degree distribution obeys the power-law and its power exponent is related to the edge-adding number m, and a small-world network which has large clustering coefficient and small average path distance
Summary
In the past two decades, complex networks have been extensively studied and have gained rich research results. Discoveries of the small world effect [1] and the scale-free feature [2] of complex networks have promoted the research of network structure [3]-[11]. BA scale-free network model [2] was proposed to promote the understanding of the real network. There are many scale-free growth network models [17] [19], all of which are obtained by changing the preferential attachment mechanism. Theoretical analysis and numerical simulations indicate the new network is a scale-free network whose degree distribution obeys the power-law and its power exponent is related to the edge-adding number m, and a small-world network which has large clustering coefficient and small average path distance. The NPG network is robust with respect to random attacks and is fragile to specific removal of a small fraction of nodes
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
