论文信息 - Gossip in random networks

Gossip in random networks

Faculty of Physics and Applied Computer Science, AGH University of Scienceand Technology, al. Mickiewicza 30, PL-30059 Cracow, PolandWe consider the average probability X of being informed on a gossip ina given social network. The network is modeled within the random graphtheory of Erdo˝s and R´enyi. In this theory, a network is characterized bytwo parameters: the size N and the link probability p. Our experimentaldata suggest three levels of social inclusion of friendship. The critical valuep

Krzysztof Malarz | Z. Szvetelszky

[1] Péter Csermely,et al. Weak links : stabilizers of complex systems from proteins to social networks , 2006 .

[2] Nicholas Emler,et al. Gossip, reputation, and social adaptation. , 1994 .

[3] G. C. Homans,et al. Social Behavior: Its Elementary Forms. , 1975 .

[4] D. Buss. Evolutionary Psychology -- The New Science of the Mind , 1998 .

[5] P. Watts. Connections , 1994 .

[6] John Sabini,et al. Moralities of Everyday Life , 1982 .

[7] S. Redner,et al. Introduction To Percolation Theory , 2018 .

[8] Robin I. M. Dunbar. Grooming, Gossip and the Evolution of Language , 1996 .

[9] H. Kazerooni. The New Scientist , 1956, Nature.