Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model

Abstract New analytic estimates for efficiency and vulnerability in the Erdös–Rénji model are presented using probabilistic properties and diameter bounds that are specific for this model and its topology. These estimates for random networks improve the known deterministic lower estimates for efficiency and vulnerability. The probabilistic technique provides a sharper approach to parametric analysis of random networks and allows us to report some new results concerning the efficiency–vulnerability relationship. Several numerical tests are presented to compare the lower estimates obtained with the empirical Erdös–Rénji random networks. These estimates illustrate how the new probabilistic estimates improve on the generic estimates reported in the literature.

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

[2]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Miguel Romance,et al.  Effective measurement of network vulnerability under random and intentional attacks , 2005, J. Math. Model. Algorithms.

[4]  Changsong Zhou,et al.  Universality in the synchronization of weighted random networks. , 2006, Physical review letters.

[5]  Miguel Romance,et al.  Asymptotic estimates for efficiency, vulnerability and cost for random networks , 2007 .

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

[7]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[8]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[9]  Carson C. Chow,et al.  Small Worlds , 2000 .

[10]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[11]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[12]  Massimo Marchiori,et al.  Economic small-world behavior in weighted networks , 2003 .

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

[14]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[15]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[16]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[17]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[18]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.