Topologies and Centralities of Replied Networks on Bulletin Board Systems

A new complex network model is studied on a Bulletin Board System (BBS) website. The model has as its vertices the identifications registered on the site, and an edge is linked if one article refers to another. Statistical characteristics of this network, such as degree distribution, average shortest-path length, and clustering coefficient are investigated. Centralities of this network including degree, betweenness, and closeness are presented. The model displays small-world characteristics with small average shortest-path lengths and a high clustering coefficient. It also exhibits scale-free topology but the exponent of power-law distribution does not exceed 2. The activity, control, and independence of communication on this network are stronger than that of some social networks. The phenomenon can be explained by the fact that the communication of viewpoints is very fast, and one person’s change of view has a significant influence on other people using the BBS.

[1]  Stefan Bornholdt,et al.  Emergence of a small world from local interactions: modeling acquaintance networks. , 2002, Physical review letters.

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

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

[4]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[5]  Víctor M Eguíluz,et al.  Epidemic threshold in structured scale-free networks. , 2002, Physical review letters.

[6]  Zhang Changshui,et al.  Reply networks on a bulletin board system. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[12]  D. Zanette.  Dynamics of rumor propagation on small-world networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[14]  Sergey N. Dorogovtsev,et al.  The shortest path to complex networks , 2004, ArXiv.

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

[16]  Damian H. Zanette.  Criticality of rumor propagation on small-world networks , 2001 .

[17]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[18]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[19]  Michael Kaufmann,et al.  Decentralized algorithms for evaluating centrality in complex networks , 2003 .

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

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

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

[23]  Valdis E. Krebs,et al.  Uncloaking Terrorist Networks , 2002, First Monday.

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

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