Gossip in random networks

Details Gossip in random networks Gossip in random networks

2006-01-20

arxiv.org/abs/physics/0601158v3

Acta Phys. Pol. B37 (2006) 3049

Physics

Physics and Society

10 pages, 3 figures in 4 eps files, for the 2nd Polish Seminar on Econo- and Sociophysics, 2006/04/21-22 Cracow, to be publish

Scientific paper

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^{-\gamma} with \gamma\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.

Affiliated with

Also associated with

No associations

Rating

Gossip in random networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Gossip in random networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gossip in random networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9854