Gossip in random networks
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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 Erdos and Renyi. 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 p_c, for which half of agents are informed, scales with the system size as N^{-γ} with γ\approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.
10 pages, 3 figures in 4 eps files, for the 2nd Polish Seminar on Econo- and Sociophysics, 2006/04/21-22 Cracow, to be published in Acta Phys. Pol. B
10 pages, 3 figures in 4 eps files, for the 2nd Polish Seminar on Econo- and Sociophysics, 2006/04/21-22 Cracow, to be published in Acta Phys. Pol. B