Competing Complex Information Spreading in Multiplex Social Network

Li, Xiang; Hou, Bocheng

doi:https://doi.org/10.1155/2021/9923837

Complexity

On this page

Abstract Introduction Discussion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Coevolving Spreading Dynamics of Complex Networks

View this Special Issue

Research Article | Open Access

Volume 2021 | Article ID 9923837 | https://doi.org/10.1155/2021/9923837

Competing Complex Information Spreading in Multiplex Social Network

Xiang Li¹and Bocheng Hou¹

Academic Editor: Wei Wang

Received05 Mar 2021

Accepted28 Apr 2021

Published11 May 2021

Abstract

Coevolution spreading dynamics on complex networks is a hot topic, which attracts much attention in network science. This paper proposes a mathematical model to describe the two competing complex information spreading dynamics on multiplex networks. An individual can only accept one of the two pieces of information. A heterogeneous mean-field theory is developed to describe the spreading dynamics. We reveal different regions through Monte Carlo simulations of the competing complex information spreading dynamics: no global information, one information dominant, and two information coexistence. We finally find that the heterogeneity of the multiplex networks’ degree distributions does not qualitatively affect the results.

1. Introduction

Social networks, e.g., WeChat, Twitter, and Facebook, are the convenient way to express and share information with friends [1–5]. Students may retransmit an article to support or oppose the opinions of the authors. To describe the interaction of two types of information spreading dynamics on social networks, researchers used the framework of coevolution spreading dynamics on complex networks [6]. Generally speaking, scholars used complex networks to describe the social network, in which the nodes represent the individuals and edges stand for the relationships among individuals. Extensive empirical analyses revealed that social network exhibits degree heterogeneity, high clustering, multilayer, and temporality [7–18]. Including some of those characteristics, many research studies have been designed (see some important reviews in this field, e.g., reference [19–21]).

Based on the shared information’s content, we can classify the information spreading dynamics into simple and complex information [22–24]. The simple information means that a single contact between the informed and susceptible individuals can trigger the infection transmission and widely used to describe epidemic spreading and simple news diffusion. In contrast, single contact cannot eliminate some complex information’s legality and reliability (e.g., political networks). Therefore, social reinforcement is included in the dynamics of complex information spreading. In the following content, we present the progress for simple and complex information spreading detailedly.

The study about the simple information spreading on complex networks independently is the most widely investigated and revealed some critical results. For instance, simple information can always spread in the social network regardless of the values of information transmission probability when the heterogeneity of degree distribution is extremely strong [25–27]. Besides, the high clustering promotes the breakout of the information while suppresses the spreading size for large transmission probability [28]. Once several information are transmitted simultaneously, scholars revealed more novel phenomena. When two pieces of information are spreading on networks consecutively, the second information’s outbreak threshold is larger than the threshold of the first information [29]. Karrer and Newman [30] further considered two competing spreading dynamics on the single network simultaneously. By using the competing percolation theory, they found that two epidemic cannot coexist in the thermodynamic limit (i.e., when the network size is extremely large). Sahneh and Scoglio [31] investigated two competing information on multiplex networks and computed the absolute-dominance and coexistence regions. When two information collaborate, i.e., if the acceptance probability for another information is enlarged when an individual accepts one information, the system exhibits a discontinuous phase transition [32–34]. Scholars considered another situation, asymmetric interacting, i.e., one spreading dynamic promotes the other. In contrast, the other one suppresses the spreading and reveals that the global epidemic will be greatly suppressed once the information spreading is included [35–37].

To include the social reinforcement in the dynamics of complex information spreading, the linear threshold model is the most widely used, in which an individual accepts the information only when the received information is larger than a threshold [22, 38–40]. Setting the final spreading size as the order parameter, researchers revealed the discontinuous phase transition in the system. More detailedly, the final spreading size versus the transmission probability exhibits a discontinuous growth. Liu et al. [41] investigated two complex information spreading consecutively on single complex network and revealed a transition for continuous and discontinuous phase transitions. Furthermore, Liu et al. [42] studied two complex synergetic information spreading dynamics on multiplex networks and revealed that the synergetic induced the discontinuous phase transition. To the best of our knowledge, there is still lacking a mathematical model to investigate two competing complex information spreading dynamics on multiplex networks. We will propose a mathematical model in section 2 and then develop a heterogeneous mean-field theory in section 3. We further study the complex competing information spreading model by using Monte Carlo simulation in section 4. Finally, we conclude in section 5.

2. Competing Complex Information Spreading Model

This section proposes the competing information spreading model on social network to describe different opinions evolving in the campus.

2.1. Network Description

Students usually discuss the events happened and diffuse the information or opinions through social platforms. We here use a multiplex network to describe the multiplex social network with two layers and , where and , respectively, represent the sizes of networks and and and , respectively, stand for the number of edges in of networks and . Nodes stand for the student users, and edges mean the relationships among those users. If two students and communicate with each other in network , an edge exists between them.

We assume there are students in the social network and and connections among them. Therefore, the average degrees of the social network are and , respectively. The two networks’ degree distribution is denoted as and , respectively. Nodes with large degrees mean that they have more communication with friends and always act as hubs. A node in two networks represents that it communicates with others through two platforms. To build the multiplex network, we first generate the intralayer edges using the uncorrelated configuration model proposed in reference [43] according the degree distributions and . Then, we build the interlayer edges randomly, that is to say, we randomly match two nodes in the two subnetworks.

2.2. Competing Spreading Dynamics

In social networks, students always express different opinions on the same event, and as a result, additional information is competing with each other. In reality, adopting an idea is risky. Therefore, social reinforcement is included. Social reinforcement means that the adoption of the information requires multiple verifications from friends. We here adopt a generalized susceptible-informed-recovered model to describe the two information spreading dynamics. The susceptible node means that it does not know the information and can adopt the information. An informed node stands for that adopted the information and willing to transmit it to friends. A node in the recovered state means that it has lost interest in the information.

The two competing information spreading dynamics are denoted as and . We assume information and , respectively, spread on networks and simultaneously. The competing between two dynamics means that a node cannot adopt two information simultaneously. The two competing spreading dynamics evolve as follows. Initially, we randomly select a node infected by and in two subnetworks. At every time step, every node informed by information () will transmit the information to its neighboring nodes in network with probability . To eliminate the information’s credibility, we include the social reinforcement and assume a node adopting information must receive pieces. A susceptible node , respectively, obtains and pieces of and information at time step , and it adopts information with probability and adopts information with probability . The informed nodes are recovered with probability . The two competing spreading dynamics evolve until there are no nodes in the informed state. The pseudocode of the competing spreading dynamics as shown in Algorithm 1. At each time step, the time complexity of the algorithm is , where is the number of edges in the network. The space complexity is .

(1)	Input: network , and dynamical parameters , , , ;
(2)	Output: spreading sizes of information and and denoted as and ;
(3)	;
(4)	Randomly a seed for information and , and put them into queue ;
(5)	while is not empty do
(6)	;
(7)	;
(8)	Initialize to be empty;
(9)	;
(10)	for to do
(11)	if Node adopt the information then Node transmits the information to every susceptible neighbor in subnetwork with probability ;
(12)	if Node received the information successfully then
(13)	;
(14)	end if
(15)	end if
(16)	if Node adopt the information then
(17)	Node transmits the information to every susceptible neighbor in subnetwork with probability ;
(18)	if Node received the information successfully then
(19)	;
(20)	end if
(21)	end if
(22)	if and then
(23)	Node adopts information with probability ;
(24)	if Node adopts information then
(25)	Adding node into queue ;
(26)	end if
(27)	Node adopts information with probability ;
(28)	if Node adopts information then
(29)	Adding node into queue ;
(30)	end if
(31)	end if
(32)	if and then
(33)	Node adopts information with probability 1;
(34)	Adding node into queue ;
(35)	end if
(36)	if and then
(37)	Node adopts information with probability 1;
(38)	Adding node into queue ;
(39)	end if
(40)	end for
(41)	for to do
(42)	Recovering node with probability ;
(43)	if Node recovers then
(44)	Delete node from queue ;
(45)	end if
(46)	end for
(47)	for to do
(48)	Adding node to queue ;
(49)	Deleting node from queue ;
(50)	end for
(51)
(52)	end while

3. Theoretical Analysis

Mathematically, the competing information spreading dynamics on social networks can be described by using the heterogeneous mean-field approach [25, 26, 44], which is widely used in investigating the dynamics on networks. There are some basic assumptions behind the heterogeneous mean-field approach as follows:(i)The network size is large enough.(ii)There are no degree-degree correlations in the network.(iii)The infection probability of informed nodes is independent, i.e., there are no dynamical correlations among nodes. Based on the above assumptions, we derive the evolution equations for competing information spreading dynamics.

To describe the evolution equations, we use the following mathematical notations , , and to represent the probability that a node with degree in subnetwork is in the susceptible, informed, and recovered state for information at time . Similarly, we use , , and to represent the probability that a node with degree in subnetwork is in the susceptible, informed, and recovered state for information at time . Since the symmetry of the two spreading dynamics, we only describe the evolution equations for one of them. At time step , the fraction of nodes in susceptible, informed, and recovered for information is , , and , respectively. In the following, we derive the evolutions of , , and .

The fraction of decreases once node with degree in subnetwork becomes informed. On the one hand, node must receive pieces of information in subnetwork at time . In uncorrelated network, the probability of node connecting to an informed node with degree is . Therefore, the probability of node transmits the information to node successfully which is . The pieces of information that node received at time are

According to descriptions of the model, we know node adopts information with probabilitywhere if ; otherwise, . Note that is the other type of information. Based the above discussions, we know the evolution of as

With a similar discussion, we know the evolutions of and asrespectively.

4. Results Analysis

In this section, we numerically study the competing information spreading on multiplex networks detailedly. We study the competing information spreading on two types of multiplex networks. The first one is ER-ER multiplex network, i.e., networks and are Erdös–Rényi (ER), in which the degree distribution follows a Poisson distribution. That is to say, the degree distribution of subnetwork is , where is the average degree of subnetwork . We assume there is no interlayer degree-degree correlations, and thus the joint degree distribution is . For ER-ER multiplex networks, the degree distribution is homogeneous. In reality, many real-data revealed that the degree distribution is heterogeneous. We therefore use the SF-SF multiplex networks, in which the two subnetworks are both scale-free networks. The degree distribution of subnetwork is , where . Similar with ER-ER multiplex networks, we assume there is no interlayer degree-degree correlations, and the joint degree distribution is . In numerical simulations, we set the network size and . The results presented in the paper are averaged over at least 1000 times.

4.1. ER-ER Multiplex Networks

Because the social reinforcement is included in the information spreading dynamics, we first study the effects of initial seed size in Figure 1. To study the fraction of new informed nodes by each information, we investigate and versus for different values of and . For small values of , e.g., , the fraction of new informed nodes by the seeds depends on the fraction of seeds shown in Figure 1(a). When the seed is small (e.g., ), any values of information transmission probability cannot trigger the global outbreak for information . Since the social reinforcement is included, a small fraction of seeds cannot further adopt the information. With the increase in , the global outbreak of becomes possible when is above the threshold point . Note that can be numerically determined by studying the variability of , and at the threshold point, exhibits a peak. We do not show in this paper. Note that the global information of cannot outbreak when , as shown in Figure 1(b). For larger values of , such as and 0.8, we find that a small fraction of seeds cannot trigger the global outbreak for the two types of information (see Figures 1(c)–1(f)). For larger values of and 0.1, increases with , meanwhile decreases with . We note that two types of information may coexist, and the coexistence conditions are discussed detailedly in Figure 2.

(a)

(b)

(c)

(d)

(e)

(f)

(a)

(b)

(c)

In Figure 2, we investigate the fractions of new informed nodes by the two types of information triggered by the initial seeds on a plane . As shown in Figure 2(a), the global information can not trigger small values . Previous studies indicated that the global information outbreak threshold of information is when there is only information spreading on network . However, when the two competing information spreads on multiplex networks simultaneously, the global information cannot break when slightly is more extensive than . We know that the competing information suppresses the spreading dynamics, and the global information outbreak threshold is much larger than . With the two information spreading dynamics’ symmetry mechanisms, we find the similar phenomena of in Figure 2(b).

One important question is the domination and coexistence of regions. Domination means that one information spreads to most nodes, while the other only transmits to a few nodes. Coexistence stands for the two types of information spread to a large fraction of nodes. To this end, we study in Figure 2(c). For the case of , we know information dominates. When , the information dominates. When , the two types of information compete for the nodes. Combing Figures 2(a)–2(c), we speculate information dominates when and . Similarly, dominates when and . The two types of information are competing with the nodes and can coexist when , , and .

In Figure 3, we further study the effects of the average degrees on the competing information spreading dynamics when . When the two types of information spreading on the two networks with the same average degree, i.e., , we find that and exhibit the similar behavior, that is to say, and increase monotonously with the increase in . However, first increases with and then decreases when , e.g., and . That is to say, there exists a peak at which reaches its maximum. Meanwhile, always increases with regardless the values of and .

(a)

(b)

4.2. SF-SF Multiplex Networks

Finally, we study the two competing information spreading on SF-SF multiplex networks in Figure 4 and investigate the effects of degree heterogeneity of the two networks on the spreading dynamics. Compared with the ER-ER networks, the SF-SF networks promote the spreading dynamics since the existence of some nodes with large degrees. In addition, we find that the degree heterogeneity does not qualitatively affect the phenomena presented in Figure 2. That is to say, the domination and coexistence regions are the same. The domination region of information is and . Similarly, information domination region is and . The coexistence region is , , and .

(a)

(b)

(c)

5. Discussion

Coevolution spreading dynamics aims at describing interacting dynamics and revealing the phenomena induced by distinct interacting mechanisms. In this paper, we proposed a competing complex information model to describe two types of information diffusion on multiplex networks. A heterogeneous mean-field theory is developed to describe the model. Through extensive numerical simulations, we revealed the conditions of different regions. Specifically, no global information outbreak region is and ; information dominant is and ; information dominant is and ; and two information coexistence region is , , and . When the two competing complex information spread on a multiplex with heterogeneous degree distribution, the phenomena do not qualitatively be affected. The results presented in this paper may shed some light into further investigating the competing spreading, such as design of effective strategy to make one spreading always win regardless of the other spreading dynamics and network structures.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was partially supported by the Ministry of Education Science and Technology Development Center University Research Innovation Fund: “Qingtai Digital Intelligence Integration” Collaborative Innovation, no. 2020QT20.

References

D. Knoke and S. Yang, Social Network Analysis, Sage Publications, Thousand Oaks, CF, USA, 2019.
G. Kossinets and D. J. Watts, “Empirical analysis of an evolving social network,” Science, vol. 311, no. 5757, pp. 88–90, 2006.
View at: Publisher Site | Google Scholar
P. J. Carrington, J. Scott, and S. Wasserman, Models and Methods in Social Network Analysis, vol. 28, Cambridge University Press, Cambridge, UK, 2005.
Y. Amichai-Hamburger and G. Vinitzky, “Social network use and personality,” Computers in Human Behavior, vol. 26, no. 6, pp. 1289–1295, 2010.
View at: Publisher Site | Google Scholar
M. Burke, C. Marlow, and T. Lento, “Social network activity and social well-being,” in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1909–1912, Atlanta, GO, USA, April 2010.
View at: Google Scholar
W. Wang, Q.-H. Liu, J. Liang, Y. Hu, and T. Zhou, “Coevolution spreading in complex networks,” Physics Reports, vol. 820, pp. 1–51, 2019.
View at: Publisher Site | Google Scholar
M. Newman, Networks, Oxford University Press, Oxford, UK, 2018.
A.-L. Barabási, “The new science of networks,” Physics Today, vol. 6, no. 5, 2003.
View at: Google Scholar
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
View at: Publisher Site | Google Scholar
F. Papadopoulos, M. Kitsak, M. Á. Serrano, M. Boguñá, and D. Krioukov, “Popularity versus similarity in growing networks,” Nature, vol. 489, no. 7417, pp. 537–540, 2012.
View at: Publisher Site | Google Scholar
P. Holme, “Rare and everywhere: perspectives on scale-free networks,” Nature Communications, vol. 10, p. 1016, 2019.
View at: Publisher Site | Google Scholar
A. Clauset, C. R. Shalizi, and M. E. J. Newman, “Power-law distributions in empirical data,” SIAM Review, vol. 51, no. 4, pp. 661–703, 2009.
View at: Publisher Site | Google Scholar
M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, “Multilayer networks,” Journal of Complex Networks, vol. 2, no. 3, pp. 203–271, 2014.
View at: Publisher Site | Google Scholar
M. De Domenico, A. Solé-Ribalta, E. Cozzo et al., “Mathematical formulation of multilayer networks,” Physical Review X, vol. 3, p. 041022, 2013.
View at: Publisher Site | Google Scholar
M. De Domenico, V. Nicosia, A. Arenas, and V. Latora, “Structural reducibility of multilayer networks,” Nature Communications, vol. 6, p. 6864, 2015.
View at: Publisher Site | Google Scholar
P. Holme, “Modern temporal network theory: a colloquium,” The European Physical Journal B, vol. 88, p. 234, 2015.
View at: Publisher Site | Google Scholar
P. Holme and J. Saramäki, Temporal Network Theory, vol. 2, Springer, Berlin, Germany, 2019.
X. Xue, L. Pan, M. Zheng, and W. Wang, “Network temporality can promote and suppress information spreading,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 30, no. 11, p. 113136, 2020.
View at: Publisher Site | Google Scholar
Z.-K. Zhang, C. Liu, X.-X. Zhan, X. Lu, C.-X. Zhang, and Y.-C. Zhang, “Dynamics of information diffusion and its applications on complex networks,” Physics Reports, vol. 651, pp. 1–34, 2016.
View at: Publisher Site | Google Scholar
C. Castellano, S. Fortunato, and V. Loreto, “Statistical physics of social dynamics,” Reviews of Modern Physics, vol. 81, no. 2, pp. 591–646, 2009.
View at: Publisher Site | Google Scholar
M. De Domenico, C. Granell, M. A. Porter, and A. Arenas, “The physics of spreading processes in multilayer networks,” Nature Physics, vol. 12, no. 10, pp. 901–906, 2016.
View at: Publisher Site | Google Scholar
D. J. Watts, “A simple model of global cascades on random networks,” Proceedings of the National Academy of Sciences, vol. 99, no. 9, pp. 5766–5771, 2002.
View at: Publisher Site | Google Scholar
D. J. Watts and P. S. Dodds, “Influentials, networks, and public opinion formation,” Journal of Consumer Research, vol. 34, no. 4, pp. 441–458, 2007.
View at: Publisher Site | Google Scholar
E. Bakshy, J. M. Hofman, W. A. Mason, and D. J. Watts, “Everyone’s an influencer: quantifying influence on twitter,” in Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 65–74, Hong Kong, China, February 2011.
View at: Google Scholar
R. Pastor-Satorras and A. Vespignani, “Epidemic dynamics and endemic states in complex networks,” Physical Review E, vol. 63, p. 066117, 2001.
View at: Publisher Site | Google Scholar
R. Pastor-Satorras and A. Vespignani, “Epidemic dynamics in finite size scale-free networks,” Physical Review E, vol. 65, p. 035108, 2002.
View at: Publisher Site | Google Scholar
S. Gómez, A. Arenas, J. Borge-Holthoefer, S. Meloni, and Y. Moreno, “Discrete-time Markov chain approach to contact-based disease spreading in complex networks,” EPL (Europhysics Letters), vol. 89, no. 3, p. 38009, 2010.
View at: Publisher Site | Google Scholar
M. E. Newman, “Random graphs with clustering,” Physical Review Letters, vol. 103, p. 058701, 2009.
View at: Publisher Site | Google Scholar
M. E. Newman, “Threshold effects for two pathogens spreading on a network,” Physical Review Letters, vol. 95, p. 108701, 2005.
View at: Publisher Site | Google Scholar
B. Karrer and M. E. Newman, “Competing epidemics on complex networks,” Physical Review E, vol. 84, p. 036106, 2011.
View at: Publisher Site | Google Scholar
F. D. Sahneh and C. Scoglio, “Competitive epidemic spreading over arbitrary multilayer networks,” Physical Review E, vol. 89, p. 062817, 2014.
View at: Publisher Site | Google Scholar
L. Chen, “Persistent spatial patterns of interacting contagions,” Physical Review E, vol. 99, p. 022308, 2019.
View at: Publisher Site | Google Scholar
L. Chen, F. Ghanbarnejad, and D. Brockmann, “Fundamental properties of cooperative contagion processes,” New Journal of Physics, vol. 19, no. 10, p. 103041, 2017.
View at: Publisher Site | Google Scholar
W. Cai, L. Chen, F. Ghanbarnejad, and P. Grassberger, “Avalanche outbreaks emerging in cooperative contagions,” Nature Physics, vol. 11, no. 11, pp. 936–940, 2015.
View at: Publisher Site | Google Scholar
W. Wang, M. Tang, H. Yang, Y. Do, Y.-C. Lai, and G. Lee, “Asymmetrically interacting spreading dynamics on complex layered networks,” Scientific Reports, vol. 4, p. 5097, 2014.
View at: Publisher Site | Google Scholar
C. Granell, S. Gómez, and A. Arenas, “Dynamical interplay between awareness and epidemic spreading in multiplex networks,” Physical Review Letters, vol. 111, p. 128701, 2013.
View at: Publisher Site | Google Scholar
W. Wang, Q.-H. Liu, S.-M. Cai, M. Tang, L. A. Braunstein, and H. E. Stanley, “Suppressing disease spreading by using information diffusion on multiplex networks,” Scientific Reports, vol. 6, p. 29259, 2016.
View at: Publisher Site | Google Scholar
M. S. Granovetter, “The strength of weak ties,” American Journal of Sociology, vol. 78, no. 6, pp. 1360–1380, 1973.
View at: Publisher Site | Google Scholar
J. P. Gleeson and D. J. Cahalane, “Seed size strongly affects cascades on random networks,” Physical Review E, vol. 75, p. 056103, 2007.
View at: Publisher Site | Google Scholar
W. Wang, M. Tang, H.-F. Zhang, and Y.-C. Lai, “Dynamics of social contagions with memory of nonredundant information,” Physical Review E, vol. 92, p. 012820, 2015.
View at: Publisher Site | Google Scholar
Q.-H. Liu, L.-F. Zhong, W. Wang, T. Zhou, and H. Eugene Stanley, “Interactive social contagions and co-infections on complex networks,” Chaos, vol. 28, p. 013120, 2018.
View at: Publisher Site | Google Scholar
Q.-H. Liu, W. Wang, S.-M. Cai, M. Tang, and Y.-C. Lai, “Synergistic interactions promote behavior spreading and alter phase transitions on multiplex networks,” Physical Review E, vol. 97, p. 022311, 2018.
View at: Publisher Site | Google Scholar
M. Catanzaro, M. Boguná, and R. Pastor-Satorras, “Diffusion-annihilation processes in complex networks,” Physical Review E, vol. 71, p. 027103, 2005.
View at: Publisher Site | Google Scholar
W. Wang, M. Tang, H. E. Stanley, and L. A. Braunstein, “Unification of theoretical approaches for epidemic spreading on complex networks,” Reports on Progress in Physics, vol. 80, p. 036603, 2017.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2021 Xiang Li and Bocheng Hou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

376

Downloads

947

Citations