Content deleted Content added
No edit summary |
m v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation) |
||
| (17 intermediate revisions by 4 users not shown) | |||
Line 1:
The spread of [[Rumor|rumors]] is an important form of [[communication]] in society. There are two approaches to investigating the rumor spreading process: microscopic models and the macroscopic models. The macroscopic models propose a macro view about this process and are mainly based on the widely-used Daley-Kendall and Maki-Thompson models. Particularly, rumor spread can be viewed as a [[stochastic process]] in social networks. By contrast, the microscopic models are more interested on micro-level interactions between individuals.
== Rumor propagation
In the last few years, there has been a growing interest in rumor propagation in
The first category is mainly based on the epidemic models. Pioneering research on rumor propagation using these models started during the 1960s.<ref name="DK">Daley, D.J., and Kendal, D.G. 1965 Stochastic rumors, J. Inst. Maths Applics 1, p. 42.</ref>
A [[Standard Model|standard model]] of rumor spreading was introduced by Daley and Kendall
*
*
*R: people who have heard the rumor, but no longer are interested in spreading it (recovered).
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.
Line 48 ⟶ 43:
which means<br />
:<math>{\alpha \over \beta}>0</math>
the
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>.
The procedure on a network is as follows:<ref>Brockmann, D. 2011 Complex Networks and Systems, Lecture Notes, Northwestern University</ref>
{{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]], 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.
}}
Line 73 ⟶ 67:
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>.
The microscopic approaches
Models include the [[independent cascade]] model, linear [[threshold model]],<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> 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 ===
== Independent Cascade (IC) Model ==
The Independent Cascade (IC) model is a probabilistic framework for modeling the spread of influence through a social network. In this model, the diffusion process unfolds in discrete time steps. When a node becomes active (i.e., influenced), it has a single chance to activate each of its inactive neighbors. The activation attempt succeeds with a certain probability, specific to the edge connecting the nodes. If the attempt fails, the neighbor cannot be activated by that node in future steps. This process continues until no more activations are possible.
Mathematically, the probability that an active node ''u'' activates an inactive neighbor ''v'' is denoted as <math>p_{uv}</math>. The activation process can be described as follows:
# At time <math>t = 0</math>, a set of seed nodes <math>A_0</math> are activated.
# For each subsequent time step <math>t \geq 1</math>, any node <math>u</math> that became active at time <math>t - 1</math> has one chance to activate each inactive neighbor <math>v</math>, with probability <math>p_{uv}</math>.
# If <math>v</math> is activated, it becomes active at time <math>t</math>; otherwise, it remains inactive.
# The process continues until no new activations occur.
This model captures scenarios where individuals independently decide to adopt a behavior or product after being influenced by their peers. It is particularly useful for modeling viral marketing and information dissemination in networks.
<ref name="Kempe2003">Kempe, D., Kleinberg, J., & Tardos, É. (2003). Maximizing the Spread of Influence through a Social Network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 137–146). https://doi.org/10.1145/956750.956769</ref>
=== Linear threshold models ===
The Linear Threshold (LT) model is another approach to modeling influence spread in social networks. In this model, each node is assigned a threshold value, representing the fraction of its neighbors that need to be active before it becomes active itself. Each edge from a neighbor to a node has an associated weight, indicating the strength of influence. The sum of incoming edge weights to a node is typically constrained to be at most 1.
Mathematically, for a node <math>v</math>, let <math>N(v)</math> be the set of its neighbors, and <math>w_{uv}</math> be the weight of the edge from neighbor <math>u</math> to <math>v</math>, such that <math>\sum_{u \in N(v)} w_{uv} \leq 1</math>. Each node <math>v</math> is assigned a threshold <math>\theta_v</math>, drawn uniformly at random from the interval [0,1].
The activation process proceeds as follows:
# At time <math>t = 0</math>, a set of seed nodes <math>A_0</math> are activated.
# For each subsequent time step <math>t \geq 1</math>, any inactive node <math>v</math> becomes active if the total weight of its active neighbors meets or exceeds its threshold:
<math>\sum_{u \in A_{t-1} \cap N(v)} w_{uv} \geq \theta_v</math>
# The process continues until no new activations occur.
The LT model reflects situations where individuals adopt behaviors based on the collective influence of their peers, such as adopting a new technology or participating in social movements.
<ref name="Kempe2003" />
=== Energy model ===
{{Empty section|date=April 2024}}
== HISB Model ==
In recent years, the rampant spread of misinformation and rumors on online social networks (OSNs) has raised significant concerns within the scientific and technological communities. OSNs are powerful tools for disseminating information, but they can also accelerate the propagation of false or misleading content, which may have serious societal consequences. Consequently, the study of rumor dynamics and the development of effective mitigation strategies have become crucial areas of research.
Several models have been proposed to analyze and control rumor spread in OSNs. Among them, the HISB model (Human Individual and Social Behavior model) stands out as a comprehensive approach that incorporates both individual cognitive factors and social influence mechanisms. This model was first introduced in,<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> where the authors proposed a rumor diffusion framework based on human behaviors in online social environments. It was later refined and applied in a more practical context for rumor mitigation in.<ref>A.I.E. Hosni, K. Li, S. Ahmed, Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors, in: Elsivier, 2019 Information science .</ref>
Subsequent enhancements were made in,<ref>A.I.E. Hosni, K. Li, Minimizing the influence of rumors during breaking news events in online social networks, in: Elsivier, 2019 knowledge based systems .</ref> where the model was adapted for breaking news scenarios, addressing the challenges of real-time rumor control. Most recently, a hybrid approach incorporating the HISB model was proposed by.<ref>Hosni, A.I.E., Baira, I., Merini, H. et al. Efficient hybrid rumor mitigation in dynamic and multilayer online social networks. Soc. Netw. Anal. Min. 14, 224 (2024). https://doi.org/10.1007/s13278-024-01381-z </ref>
These successive contributions illustrate the robustness and adaptability of the HISB framework in tackling the evolving nature of misinformation in OSNs. This article provides a comprehensive overview of rumor propagation models, with a focus on those incorporating behavioral dynamics, and discusses state-of-the-art strategies for minimizing rumor influence.
This article adopts the HISBmodel for simulating rumor diffusion. Below, we provide an overview of its key components.
=== Individual Behaviors Toward Rumors ===
The HISBmodel represents the behavior of individuals facing a rumor through three main factors:
# '''Background Knowledge''' (\$\beta\$): Reflects an individual's knowledge of the rumor's topic, influencing their judgment of its [[credibility]].
# '''Hesitation Mechanism''' (\$\delta\$): Represents the delay before spreading a rumor, modeling skepticism or doubt.
# '''Forgetting-Remembering Factor''' (\$\omega\$): Linked to the user's engagement with the OSN platform and their likelihood of recalling the rumor.
An individual's attraction to a rumor over time is modeled after [[damped harmonic motion]]:
:<math>A\_u(t) = A\_{int}^u e^{-\beta\_u t} \left| \sin(\omega\_u t + \delta\_u) \right|</math>
where <math>A\_u(t)</math> is the attraction of user <math>u</math> to the rumor at time <math>t</math>, and <math>A\_{int}^u</math> is the initial attraction.
=== Propagation Process in [[Multilayer Networks]] ===
The model operates on a dynamic [[multilayer grap]]h <math>{G\_1}\_t, \ldots, {G\_n}\_t</math>, where each layer represents a different OSN or mode of interaction over time <math>t \in {0,1,\ldots,T}</math>. Each user can be in one of three states:
* '''Ignorant''': Not yet exposed to the rumor
* '''Spreader''': Currently spreading the rumor
* '''Stifler''': No longer spreading the rumor
At each time step <math>t-1</math>, spreaders may transmit the rumor according to one of two models:
# '''One2One Model''' (<math>\sigma'</math>): A spreader chooses one random neighbor to contact.
# '''One2Many Model''' (<math>\sigma</math>): A spreader contacts a subset of its neighbors.
The probability of rumor transmission from node <math>u</math> to <math>v</math> on layer <math>i</math> at time <math>t</math> is given by:
:<math>p\_{u,v,i}(t) = p\_u^{send}(t) \cdot (p\_u)*i \cdot (p*{v,u}^{acc})\_i</math>
With the components defined as:
:<math>p\_u^{send}(t) = e^{-\beta\_u t} |\sin(\omega\_u t + \delta\_u)|</math>
:<math>(p\_u)*i = \frac{(d*{in})*i(u)}{\sum*{j=1}^k (d\_{in})*j(u)}</math>
:<math>(p*{v,u}^{acc})*i = \frac{1}{1 + \frac{(d*{in})*i(v)}{(d*{in})\_i(u)}} \cdot P</math>
where <math>P</math> is a tunable propagation probability and <math>(d\_{in})\_i(u)</math> is the in-degree of <math>u</math> in layer <math>i</math>.
The global popularity of the rumor is measured as:
:<math>R(t) = \sum\_{i=1}^n R\_i(t), \quad \text{where} \quad R\_i(t) = \sum\_{v \in V} A\_v(t) \cdot (d\_{in})\_i(v)</math>
The rumor ceases to propagate when <math>R(t) \approx 0</math>.
=== Individual Opinion Dynamics ===
Individuals' opinions evolve using a discrete-time [[Markov chain]] with states:
* Supporting (S)
* Questioning (Q)
* Neutral (N)
* Denying (D)
Each node <math>v</math> has a transition matrix:
<math>
P_v = \begin{bmatrix}
1 - \rho & \frac{\rho}{2} & \frac{\rho}{2} & 0 \\
\frac{1 - \rho}{3} & \frac{1 - \rho}{3} & \frac{1 - \rho}{3} & \rho \\
\frac{1 - \rho}{3} & \frac{1 - \rho}{3} & \frac{1 - \rho}{3} & \rho \\
0 & \frac{1 - \rho}{2} & \frac{1 - \rho}{2} & \rho \\
\end{bmatrix}
</math>
The decision factor <math>\rho</math> is given by:
:<math>\rho = \frac{n\_v^-}{n\_v} \cdot J\_v</math>
where <math>n\_v^-, n\_v</math> are the numbers of negative and total received rumors, and <math>J\_v</math> reflects personal judgment.
The [[steady-state]] probability of denying a rumor is:
:<math>\pi\_D(\rho) = \frac{\rho^2 - 2\rho + 1}{\rho^2 + \rho + 1}</math>
Denoting <math>\pi\_v^- = \pi\_D(\rho\_v)</math> and <math>\pi\_v^+ = 1 - \pi\_v^-</math>, the model can predict long-term belief adoption.
This enhanced HISBmodel [[framework]] thus enables nuanced, multilayer-aware modeling of how rumors spread and opinions evolve across interconnected OSNs.
== References ==
| |||