View source for Social:Rumor spread in social network

[[Unsolved:Rumor|Rumor]] is an important form of social [[Biology:Communication|communication]]s, and the spread of rumors plays a significant role in a variety of human affairs. There are two approaches to investigate the rumor spreading process: the microscopic models and the macroscopic models.
The macroscopic models propose a macro view about this process are mainly based on the widely used Daley-Kendall and Maki-Thompson models. Particularly, we can view rumor spread as a [[Stochastic process|stochastic process]] in social networks.
While the microscopic models are more interested more on the micro interactions between individuals.

== Rumor propagation Models ==
In the last few years, there has been a growing interest in rumor propagation in Online social networks problems where different approaches have been proposed to investigate it.
By carefully scrutinizing the existing literature, we categorize the works into macroscopic and microscopic approaches.

=== Macroscopic models ===
The first category is mainly based on the Epidemic models <ref name=DK>Daley, D.J., and Kendal, D.G. 1965 Stochastic rumors, J. Inst. Maths Applics 1, p. 42.</ref> where  the pioneering research engaging rumor propagation under these models started during the 1960s.

==== Epidemic models====
A standard model of rumor spreading was introduced by Daley and Kendall,<ref name=DK/>. Assume there are N people in total. And those people in the network are categorized into three groups: ignorants, spreaders and stiflers, which are denoted as S, I, and R respectively hereinafter:

*I: people who are ignorant of the rumor;
*S: people who actively spread the rumor;
*R: people who have heard the rumor, but no longer are interested in spreading it.

The rumor is propagated through the population by pair-wise contacts between spreaders and others in the population. Any spreader involved in a pair-wise meeting attempts to “infect” the other individual with the rumor. In the case this other individual is an ignorant, he or she becomes a spreader. In the other two cases, either one or both of those involved in the meeting learn that the rumor is known and decided not to tell the rumor anymore, thereby turning into stiflers.

One variant is the Maki-Thompson model.<ref>Maki, D.P. 1973 Mathematical Models and Applications, With Emphasis on Social, Life, and Management Sciences, Prentice Hall.</ref> In this model, rumor is spread by directed contacts of the spreaders with others in the population. Furthermore, when a spreader contacts another spreader only the initiating spreader becomes a stifler. Therefore, three types of interactions can happen with certain rates. 
{{NumBlk|;|<math>\begin{matrix}{}\\ S+I\xrightarrow{\alpha}2S \\{}\end{matrix}</math>|{{EquationRef|1}}}}
::which says when a spreader meet an ignorant, the ignorant will become a spreader. 
{{NumBlk|;|<math>\begin{matrix}{}\\ S+S\xrightarrow{\beta}S+R \\{}\end{matrix}</math>|{{EquationRef|2}}}}
::which says when two spreaders meet with each other, one of them will become a stifler.
{{NumBlk|;|<math>\begin{matrix}{}\\ S+R\xrightarrow{\beta}2R  \\{}\end{matrix}</math>|{{EquationRef|3}}}}
::which says when a spreader meet a stifler, the spreader will lose the interest in spreading the rumor, so become a stifler.

Of course we always have conservation of individuals:<br />
:<math> N=I+S+R </math>

The change in each class in a small time interval is:<br />
:<math> \Delta S \approx - \Delta t \alpha IS/N</math>
:<math> \Delta I \approx \Delta t [{\alpha IS \over N} - {\beta I^2 \over N} - {\beta IR \over N}]</math>
:<math> \Delta R \approx \Delta t [{\beta I^2 \over N}+{\beta IR \over N}] </math>

Since we know <math>S</math>, <math>I</math> and <math>R</math> sum up to <math>N</math>, we can reduce one equation from the above, which leads to a set of differential equations using relative variable <math>x=I/N</math> and <math>y=S/N</math> as follows<br />
:<math> {dx \over dt} = x \alpha y - \beta x^2 - \beta x(1-x-y) </math>
:<math> {dy \over dt} = - \alpha xy</math>
which we can write
:<math> {dx \over dt} = (\alpha + \beta)xy - \beta x </math>
:<math> {dy \over dt} = - \alpha xy</math>

Compared with the ordinary [[Compartmental models in epidemiology|SIR model]], we see that the only difference to the ordinary [[Compartmental models in epidemiology|SIR model]] is that we have a factor <math>\alpha + \beta</math> in the first equation instead of just <math>\alpha</math>. We immediately see that the ignorants can only decrease since <math>x,y\ge 0</math> and <math>{dy \over dt}\le 0</math>. Also, if<br />
:<math>R_0={\alpha +\beta \over \beta} >1 </math>
which means<br />
:<math>{\alpha \over \beta}>0</math>
the rumour model exhibits an “epidemic” even for arbitrarily small rate parameters.

==== Epidemic models in social network ====
We model the process introduced above on a network in discrete time, that is, we can model it as a DTMC. Say we have a network with N nodes, then we can define <math> X_i(t)</math> to be the state of node i at time t. Then <math>X(t)</math> is a stochastic process on <math>S=\{S,I,R\}^N</math>. At a single moment, some node i and node j interact with each other, and then one of them will change its state. Thus we define the function <math>f</math> so that for <math>x</math> in <math>S</math>,<math>f(x,i,j)</math> is when the state of network is <math>x</math>, node i and node j interact with each other, and one of them will change its state. The transition matrix depends on the number of ties of node i and node j, as well as the state of node i and node j. For any <math>y=f(x,i,j)</math>, we try to find <math>P(x,y)</math>. If node i is in state I and node j is in state S, then <math>P(x,y)=\alpha A_{ji}/k_i</math>; if node i is in state I and node j is in state I, then <math>P(x,y)=\beta A_{ji}/k_i</math>; if node i is in state I and node j is in state R, then <math>P(x,y)=\beta A_{ji}/k_i</math>. For all other <math>y</math>, <math>P(x,y)=0</math>.<br />      
The procedure<ref>Brockmann, D. 2011 Complex Networks and Systems, Lecture Notes, Northwestern University</ref> on a network is as follows:
{{ordered list
|1= We initial rumor to a single node <math>i</math>;
  
|2= We pick one of its neighbors as given by the [[Adjacency matrix|adjacency matrix]], so the probability we will pick node <math>j</math> is <br />
<math>p_j={A_{ji} \over k_i}</math> <br />
where <math>A_{ji}</math> is from the adjacency matrix and <math>A_{ji}=1</math> if there is a tie from <math>i</math> to <math>j</math>, and <math>k_i=	\textstyle \sum_{j=1}^N A_{ij}</math> is the [[Degree (graph theory)|degree]] for node <math>i</math>; 
  
|3= Then have the choice: {{ordered list|list_style_type=lower-alpha
     |1=  If node <math>j</math> is an ignorant, it becomes a spreader at a rate <math>\alpha</math>;
     |2=  If node <math>j</math> is a spreader or stifler, then node <math>i</math> becomes a stifler at a rate <math>\beta</math>. 
     }}
|4= We pick another node who is a spreader at random, and repeat the process.
}}

We would expect that this process spreads the rumor throughout a considerable fraction of the network. Note however that if we have a strong [[Clustering coefficient|local clustering]] around a node, what can happen is that many nodes become spreaders and have neighbors who are spreaders. Then, every time we pick one of those, they will recover and can extinguish the rumor spread. On the other hand, if we have a network that is [[Small-world network|small world]], that is, a network in which the shortest path between two randomly chosen nodes is much smaller than that one would expect, we can expect the rumor spread far away.

Also we can compute the final number of people who once spread the news, this is given by<br />
<math>r_\infty=1-e^{-({\alpha +\beta \over \beta})r_\infty}</math> <br />
In networks the process that does not have a threshold in a well mixed population, exhibits a clear cut phase-transition in small worlds. The following graph illustrates the asymptotic value of <math>r_\infty</math> as a function of the rewiring probability <math>p</math>.

=== Microscopic models ===
The microscopic approaches attracted more attention in the individual's interaction: "who influenced whom."
The known models in this category are the information cascade and the linear threshold models,<ref>[1] D. Kempe, J. Kleinberg, É. Tardos, Maximizing the spread of influence through a social network, Proc. Ninth ACM SIGKDD Int. Conf. Knowl. Discov. Data Min. - KDD ’03. (2003) 137. doi:10.1145/956755.956769.</ref> the energy model,<ref>S. Han, F. Zhuang, Q. He, Z. Shi, X. Ao, Energy model for rumor propagation on social networks, Phys. A Stat. Mech. Its Appl. 394 (2014) 99–109. doi:10.1016/j.physa.2013.10.003.</ref> HISBmodel <ref>A.I.E. Hosni, K. Li, S. Ahmed, HISBmodel : A Rumor Diffusion Model Based on Human Individual and Social Behaviors in Online Social Networks, in: Springer, 2018.</ref> and Galam's Model.<ref>S. Galam, Modelling rumors: The no plane Pentagon French hoax case, Phys. A Stat. Mech. Its Appl. 320 (2003) 571–580. doi:10.1016/S0378-4371(02)01582-0.</ref>

==== Independent cascades models ====

==== Linear threshold models ====

==== Energy model ====

==== HISBmodel model ====
The HISBmodel is a rumor propagation model that can reproduce a  trend of this phenomenon and provide indicators to assess the impact of the rumor to effectively understand the diffusion process and reduce its influence.
The variety that exists in human nature makes their decision-making ability pertaining to spreading information unpredictable, which is the primary challenge to model such a complex phenomenon.
Hence, this model considers the impact of human individual and social behaviors in the spreading process of the rumors.
The HISBmodel proposes an approach that is parallel to other models in the literature and concerned more with how individuals spread rumors.
Therefore,  it try to understand the behavior of individuals, as well as their social interactions in OSNs, and highlight their impact on the dissemination of rumors.
Thus, the model, attempts to answer the following question: ``When does an individual spread a rumor? When does an individual accept rumors? In which OSN does this individual spread the rumors?''.
First, it proposes a formulation of individual behavior towards a rumor analog to damped harmonic motion, which incorporates the opinions of individuals in the propagation process.
Furthermore, it establishes rules of rumor transmission between individuals.
As a result, it presents the HISBmodel propagation process, where new metrics are introduced to accurately assess the impact of a rumor spreading through OSNs.

== References ==

<references />

[[Category:Social networks]]

{{Sourceattribution|Rumor spread in social network}}