Search for content and authors
 

Gossip in random networks

Krzysztof Malarz 1,  Zsuzsanna Szvetelszky 2,  Balazs Szekfu 3,  Krzysztof Kułakowski 1

1. AGH University of Science and Technology, Faculty of Physics and Applied Computer Science (AGH), Mickiewicza 30, Kraków 30-059, Poland
2. Eotvos University, Faculty of Informatics, Budapest, Budapest H-1518, Hungary
3. BUTE FESS, Department of Information and Knowledge Management, Budapest Pf. 91, Budapest H-1521, Hungary

Abstract
We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erdös and Rényi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value pc, for which half of agents are informed, scales with the system size as N-γ with γ=0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of correlations between neighbors is also evaluated: with increasing the clustering coefficient C, X decreases.

[1] arXiv preprint: physics/0601158

 

Legal notice
  • Legal notice:

    Copyright (c) Pielaszek Research, all rights reserved.
    The above materials, including auxiliary resources, are subject to Publisher's copyright and the Author(s) intellectual rights. Without limiting Author(s) rights under respective Copyright Transfer Agreement, no part of the above documents may be reproduced without the express written permission of Pielaszek Research, the Publisher. Express permission from the Author(s) is required to use the above materials for academic purposes, such as lectures or scientific presentations.
    In every case, proper references including Author(s) name(s) and URL of this webpage: https://science24.com/paper/5847 must be provided.

 

Related papers
  1. Heider balance in bilayer networks
  2. Hierarchical Partitions of Social Networks Between Rivaling Leaders
  3. New constant of motion for coevolving voter model
  4. Influence of a range of interaction among agents on efficiency of knowledge transfer within an organization
  5. Multiples of ten in the survey data on the number of friends
  6. Paradox of integration – mean field approach
  7. Paradox of integration - a computational model
  8. No more presidents in my family
  9. The Simmel effect and babies names
  10. Reputation-based cooperation – what if errors?
  11. Distribution of time lags between pedestrians
  12. Critical slowing down in strategy selection in crowd
  13. More stochastic repulsion in culture dissemination 
  14. A line graph as a model of a social network
  15. Time lags in evacuation in the social force model
  16. Bounded confidence model: addressed information maintain diversity of opinions
  17. Indifferents as an interface between Contra and Pro
  18. The Zaller model of mass opinion with interactions
  19. The norm game in a mean-field society
  20. The Sznajd dynamics in a social network
  21. Magnetic ordering in a social structure
  22. Efficiency of social dimerization
  23. Needs and decisions in ghetto
  24. Matrix representation of evolving networks
  25. The Heider balance and social distance

Presentation: Oral at 2 Ogólnopolskie Sympozjum "Fizyka w Ekonomii i Naukach Społecznych", Sociophysics, by Krzysztof Malarz
See On-line Journal of 2 Ogólnopolskie Sympozjum "Fizyka w Ekonomii i Naukach Społecznych"

Submitted: 2005-11-16 13:13
Revised:   2009-06-07 00:44