Assortative mixing in networks.

A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

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

[2]  J. Hopcroft,et al.  Are randomly grown graphs really random? , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[4]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..

[5]  Neo D. Martinez.  Artifacts or Attributes? Effects of Resolution on the Little Rock Lake Food Web , 1991 .

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

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

[8]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[9]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

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

[11]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[12]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[13]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[14]  M. Morris,et al.  Telling tails explain the discrepancy in sexual partner reports , 1993, Nature.

[15]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[17]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[18]  Alessandro Vespignani,et al.  Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Lada A. Adamic,et al.  Power-Law Distribution of the World Wide Web , 2000, Science.

[20]  S. Strogatz.  Exploring complex networks , 2001, Nature.

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

[22]  P. Gács,et al.  Algorithms , 1992 .

[23]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[24]  M. Huxham,et al.  Do Parasites Reduce the Chances of Triangulation in a Real Food Web , 1996 .

[25]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[26]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

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

[28]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[29]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[30]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[32]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[33]  Jerrold W. Grossman,et al.  A portion of the well-known collaboration graph , 1995 .

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

[35]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .