Evolving networks with bimodal degree distribution

Abstract Networks with bimodal degree distribution are most robust to targeted and random attacks. We present a model for constructing a network with bimodal degree distribution. The procedure adopted is to add nodes to the network with a probability p and delete the links between nodes with probability (1 − p). We introduce an additional constraint in the process through an immunity score, which controls the dynamics of the growth process based on the feedback value of the last few time steps. This results in bimodal nature for the degree distribution. We study the standard quantities which characterize the networks, like average path length and clustering coefficient in the context of our growth process and show that the resultant network is in the small world family. It is interesting to note that bimodality in degree distribution is an emergent phenomenon.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

[3]  Alpan Raval,et al.  Identifying Hubs in Protein Interaction Networks , 2009, PloS one.

[4]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[5]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[6]  A. Martin-Löf,et al.  Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.

[7]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Christian Borgs,et al.  Emergence of tempered preferential attachment from optimization , 2007, Proceedings of the National Academy of Sciences.

[12]  P. L. Krapivsky,et al.  The power of choice in growing trees , 2007, 0704.1882.

[13]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[14]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[15]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[16]  Avinoam Rabinovitch,et al.  Topological changes at the gel transition of a reversible polymeric network , 2009 .

[17]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

[18]  Reuven Cohen,et al.  Complex Networks: Structure, Robustness and Function , 2010 .

[19]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[20]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Thilo Gross,et al.  All scale-free networks are sparse. , 2011, Physical review letters.

[22]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[23]  Fenguangzhai Song.  CD , 1992 .

[24]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[25]  Doyle,et al.  Highly optimized tolerance: robustness and design in complex systems , 2000, Physical review letters.

[26]  H. Stanley,et al.  Optimization of the robustness of multimodal networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.