# Gossip in random networks

Source: [Gossip in random networks](<https://www.sota2.com/research/paper/68fa20537a2b558e2933033f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T21:37:04.100Z

Authors: K.Malarz, Z.Szvetelszky, B.Szekfu, K.Kulakowski

Published: 2006-01-20T16:52:47.000Z

## 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 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/physics/0601158>)

[PDF](<https://arxiv.org/pdf/physics/0601158.pdf>)
