Why are rumors spreading quickly on social media

So, one mechanism that allows the rapid spread of rumors on social networks is that small-degree nodes quickly learn the rumor of an informed neighbor and then quickly forward it to all other neighbors. Some centers with many connections share with many people with few connections. This class includes people who do not know the rumor; if they hear it, they will most likely believe it and spread it without contemplating it or seeking confirmation. This result shows that the expansion threshold of heterogeneous networks is lower than that of homogeneous networks when the parameters and the average degree of the networks are equivalent in both networks.

The social networking service (SNS) is the main platform for spreading rumors due to its many users and complex network structure. Model for spreading rumors and authoritative information that considers super-dissemination on complex social networks. Similarly, it takes an expected number of time steps of approximately dB until B calls A, getting the rumor out of there. As a result, it presents the HisbModel propagation process, where new metrics are introduced to accurately assess the impact of a rumor that spreads through NSOs.

The study of the spread of rumors or the control of rumors is important and necessary because rumors can cause serious negative effects on society. The dispersion thresholds of this model in homogeneous and heterogeneous networks and their relationship are also discussed in this section. In similar studies, the basic reproduction number (denoted as R0) is generally used to describe the number of secondary cases caused by a propagator in a completely ignorant population35.Confusion and the importance of rumors only represent the characteristic of words, while credibility can fully describe the persuasion of rumors to people. Any spreader involved in a couple meeting tries to “infect the other individual with the rumor.

We support this finding by analyzing information dissemination in the mathematically defined preferential connection network (PA) topology, a common model for real-world networks, which demonstrates that sublogarithmic time is sufficient to spread news to all nodes of a network. For example, a rumor started in a random node of the Twitter network reaches an average of 45.6 million of the total 51.2 million members in just eight rounds of communication.

Leave Message

All fileds with * are required