Network bipartivity.

Systems with two types of agents with a preference for heterophilous interaction produce networks that are more or less close to bipartite. We propose two measures quantifying the notion of bipartivity. The two measures-one well known and natural, but computationally intractable, and the other computationally less complex, but also less intuitive-are examined on model networks that continuously interpolate between bipartite graphs and graphs with many odd circuits. We find that the bipartivity measures increase as we tune the control parameters of the test networks to intuitively increase the bipartivity, and thus conclude that the measures are quite relevant. We also measure and discuss the values of our bipartivity measures for empirical social networks (constructed from professional collaborations, Internet communities, and field surveys). Here we find, as expected, that networks arising from romantic online interaction have high, and professional collaboration networks have low, bipartivity values. In some other cases, probably due to low average degree of the network, the bipartivity measures cannot distinguish between romantic and friendship oriented interaction.

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

[2]  G. Bianconi.  Mean field solution of the Ising model on a Barabási–Albert network , 2002, cond-mat/0204455.

[3]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[4]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[5]  Moshe Gitterman,et al.  Small-world phenomena in physics: the Ising model , 2000 .

[6]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  K. Hukushima,et al.  Exchange Monte Carlo Method and Application to Spin Glass Simulations , 1995, cond-mat/9512035.

[8]  C. Herrero.  Ising model in small-world networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  L. Freeman.  Segregation in Social Networks , 1978 .

[10]  D. Stauffer,et al.  Ferromagnetic phase transition in Barabási–Albert networks , 2001, cond-mat/0112312.

[11]  P Svenson.  Freezing in random graph ferromagnets. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[13]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[14]  Dynamic critical behavior of the XY model in small-world networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Duncan MacRae join,et al.  Direct Factor Analysis of Sociometric Data , 1960 .

[16]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[20]  Computer model of metallic spin-glasses , 1980 .

[21]  G. R. Schreiber,et al.  Cut Size Statistics of Graph Bisection Heuristics , 1999, SIAM J. Optim..

[22]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

[23]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[24]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[25]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  G. Wannier,et al.  Antiferromagnetism. The Triangular Ising Net , 1950 .

[27]  Denis Boyer,et al.  Interface motion and pinning in small-world networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[29]  P Minnhagen,et al.  XY model in small-world networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Luís A. Nunes Amaral,et al.  Sexual networks: implications for the transmission of sexually transmitted infections. , 2003, Microbes and infection.

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

[32]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

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

[35]  R. Houtappel.  Order-disorder in hexagonal lattices , 1950 .

[36]  Eve Passerini,et al.  Statistical mechanics of collective behavior: Macro‐sociology , 1998 .

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

[38]  Eve Passerini,et al.  Statistical mechanics of opinion formation and collective behavior: Micro‐sociology , 1998 .

[39]  Steven Durlauf,et al.  How can statistical mechanics contribute to social science? , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[40]  P. Anderson,et al.  Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .