Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2020 Jul 22;10:12160. doi: 10.1038/s41598-020-69098-5

Cooperation and Competition among information on social networks

Zhiqiang Zhu 1,, Chang Gao 1, Yumeng Zhang 1, Hainan Li 1, Jin Xu 2, Yongli Zan 3, Zhi Li 1
PMCID: PMC7376155  PMID: 32699320

Abstract

When multiple information are spread on social networks, there may be Cooperation and Competition among these information. Based on a new spreading model of multiple information, we studied Cooperation and Competition in information spreading, and analyzed the influence of different factors on Cooperation and Competition. Through a large number of computer simulation experiments, we found that: (1) when multiple information are spread on social networks, there is Cooperation and Competition among these information; (2) the smaller the distance between two information sources is, the stronger the Cooperation and Competition among these information are; (3) the greater the value of social reinforcement is, the stronger the Cooperation and Competition among these information are; (4) the weaker the human heterogeneity of one information is, the stronger the Cooperation and Competition among this information and other information are.

Subject terms: Complex networks, Statistical physics

Introduction

With the development of Internet technologies and the emergence of online social networks, the research of information spreading dynamics on complex networks has attracted a lot of attention from academia111. The emergence of online social networks12, on the one hand, is conducive to the information spreading, strengthening information communication and emotional communication between people13. For example, people use the social network to carry out viral marketing to promote their products, so that they are spreading faster and the people receiving information are more widely. On the other hand, the social network makes rumors, public opinions and other information spread quickly on the Internet. For example, the vast development of online social networks (Twitter, Facebook, etc.) has facilitated the spread of rumors in the population and made the influence of rumors much wider than ever before14.

Information are passed from one user to another through social networks. When people read newspapers, watch TV or browse news websites, they will constantly choose whether to accept certain media content. Once they received some information, they share posts with friends on social networks.

The widely adopted models of information spreading, such as Linear Threshold Model15,16, Generalized Threshold Model17, Independent Cascade Model18, all consider each information in isolation, independent of others. But the reality is that multiple information not only spread on the network at the same time, but also affect each other in the process of information spreading.

In the real world, there are usually multiple information spread on the network simultaneously. In addition, the information does not spread in isolation, depending on all other information currently spreading on the network. For example, we consider two news reports with similar content on the same event that are spread on the network at the same time. It is easy to see that these information would help each other in spreading, and many users would see these news reports. This would make them think the news report is real and very important, so they are more likely to accept and share it. In this case, these information help each other (“Cooperation”) in spreading. On the contrary, if we consider the two conflicting news reports on the same event, they would restrain each other in spreading. Because when users see these news reports, they have to choose to accept either or not. So in this case, these information inhibit each other (“Competition”) in spreading. Therefore, Competition reduces the possibility of spread, while Cooperation helps each other to be more widely spread on the network19.

In order to simulate information spreading more realistically, the model should include the interaction between information, so as to analyze the problems related to spreading dynamics1921. We build a new model of information spreading in this paper, which can simulate multiple information spreading on the network at the same time, and there is interaction between information in the process of information spreading.

In recent years, a large number of scholars have done a lot of researches on the problem of spreading dynamics2224, and some works related to this paper are as follows2532.

Dodds and Watts25 introduced “memory effects” into the process of information spreading and found that “memory effects” affect the information spreading on the network. Centola26 used empirical research to find that the “social reinforcement” can affect the information spreading. Some researchers found that “social reinforcement” plays an important role in the spread of opinions, news, innovations and fads2730. Lü et al.31 proposed a model to emphasize the difference between information spreading and epidemic spreading, and their model took into account of “memory effects”, “social reinforcement” and “non-redundancy of contacts”. Zhu et al.32 firstly put forward the concept of “human heterogeneity”, and proposed a model to emphasize the influence of human heterogeneity on information spreading, which includes four spreading mechanisms: (1) memory effects, (2) social reinforcement, (3) non-redundancy of contacts, (4) human heterogeneity.

In this paper, we study Cooperation and Competition in information spreading. Through computer simulation experiments on real social networks, we propose a spreading model of multiple information and analyze the interaction of information in information spreading. If two kinds of information are positive correlation, they will promote information spreading (that is, Cooperation) when they are spread on a network at the same time; but if they are negative correlation, they will inhibit information spreading (that is, Competition).

The models in Zhu et al.32 and other researches1518 are only suitable for the spread of single information, or the spread of multiple information but the information spread in isolation. The model in this paper is based on the model in32 and adds the property of “interaction between information”. Our new model is suitable for the spread of multiple information on the network. By adjusting the value of parameter β in the model, we can use computer to simulate that: when β=0, we can simulate that multiple information spread independently on the network; when β0, we can simulate the spread of multiple information on the network, and there is interaction between information in the process of spreading. In addition, our spreading model considers four spreading mechanisms: (1) memory effects, (2) social reinforcement, (3) non-redundant contact, (4) human heterogeneity. Our model can be extended to the cases that three or more information spread on social networks at the same time.

The main contributions of our research to the field of spreading dynamics are as follows:

  1. We propose a new spreading model. The model includes more comprehensive spreading mechanisms, which is not only applicable to the spread of multiple information on the network, but also can simulate the interaction of multiple information in the process of spreading. Therefore, this model is closer to the real process of spreading than other models2232.

  2. The main innovations of this study are as follows:

Based on the new information spreading model, the following important results can be obtained by adjusting the values of different parameters in the spreading model.

  1. When multiple information are spread on social networks, there is Cooperation and Competition among these information.

  2. Various factors (distance between two information sources, social reinforcement, human heterogeneity) have important influence on Cooperation and Competition in information spreading.

In order to simplify the expression, we use the term “simulation experiments” to express the experiments that simulate the information spreading on the network through the computer.

Methods

Next, we mainly analyze the Cooperation and Competition among multiple information in the spreading by implementing two contents: (1) Building a new spreading model; (2) Based on the new spreading model, we conduct simulation experiments on real social networks to analyze the influence of various factors in information spreading on Cooperation and Competition.

In order to understand the model more deeply and systematically, the next two parts (“Basic Definitions” and “Process of Information Spreading”) explain some concepts and related contents in the model. Then, the background networks of the simulation experiments and how to analyze the influence of related factors on the Cooperation and Competition in information spreading are described in “Preparations for Simulation Experiments”.

Basic definitions

Suppose that two kinds of information A and B are spreading on the network G. Each node represents an individual, and each edge represents the social relationship between two individuals. Table 1 shows the definitions and characteristics of some related terminologies in our model.

Table 1.

The definitions and characteristics of some related terminologies in the model.

Terminology Symbol Definition Characteristics
Information attribute IL It is a constant (value range from 0 to 1) that reflects the degree of difficulty in accepting information L by individuals The smaller information attribute is, the easier individuals will accepted information L
Individual attribute IL(v) It is a constant (value range from 0 to 1) that reflects the extent of acceptance for any individual v when v first hears L The larger the individual attribute is, the easier information L will be accepted
The coverage ofinformation spreading η It is the proportion of individuals who accept information to all individuals (value range from 0 to 1)
Correlation Coefficientbetween two kinds ofinformation β It is a constant (value range from 0 to 1): (1) 0<β1(-1β<0), indicating that when an individual receives two information, one information can promote (restrain) the individual to accept another information; (2) β=0, indicating that two information do not affect each other The greater the value of β is, the easier the information is to spread
Memory effects ML(v,t) The individual v has received the information L for ML(v,t) times until t time step. In the spreading process, as time goes on, once v receives L, the value of ML(v,t) is increased by 1 The greater the value of ML(v,t) is, the easier information L will be accepted
Social reinforcement c The constant c(c>0) reflects the influence of social reinforcement The greater the value of c is, the easier the information is to spread
Non-redundant contact In the spreading process, each edge on the network is used at most once
Human heterogeneity The difference of individual attribute reflects the intensity of human heterogeneity The greater the fluctuations of individual attribute is, the stronger human heterogeneity is

In order to analyze Cooperation and Competition in information spreading, β is equal to 1, -1 and 0 in this paper. By comparing the coverage of information spreading when β=1 and β=0 (β=-1 and β=0), we find that there is Cooperation (Competition) in information spreading when β=1 and β=0 (β=-1 and β=0): The spread of one information on social network would promote (inhibit) the spread of another information.

Process of information spreading

The spreading process of two kinds of information A and B on the network is shown in Fig. 1.

Figure 1.

Figure 1

The spreading process of two kinds of information A and B on the network.

At the process of information spreading, each individual is in one of the four states:

  1. Unknown”: the individual has not yet come into contact with the information.

  2. Known”: the individual has come into contact with the information, but it does not spread to others because he is suspicious of the authenticity of information.

  3. Accepted”: the individual accepts the information and then spread it to all his neighbors.

  4. Exhausted”: after spreading the information to his neighbors, the individual will lose interest and never spread this information again.

The main process of information spreading are shown below:

At the beginning of information spreading, two nodes are randomly chosen as the spreading sources and the others are in the “Unknown” state.

Process 1. (1th step) These two sources spread the information to all of their neighbors, then become “Exhausted” state.

Process 2. If there are new individuals accepting information in Tth step (T1), the information will continue to spread, that is, these individuals will spread information to their neighbors at the same time in (T+1)th step; otherwise, the whole spreading process is over.

Suppose that at least one individual accepts information in (T-1)th step (T2), and individual v is one of their neighbors whose state is “Unknown” or “Known”, then the individual judges whether to accept the information according to the following methods:

  1. If IAIA(v)[c(MA(v,T)+β·MB(v,T)-1)+1], individual v will accept information A in Tth step and spread information A to all his neighbors in (T + 1)th step, and v is in the “Exhausted” state for information A; otherwise, v do nothing no matter how many times this individual has received information A.

  2. If IBIB(v)[c(MB(v,T)+β·MA(v,T)-1)+1], the conclusion of whether individual v accepts information B is similar to that in (a).

However, if individual v does not receive information A and B in the Tth step, he will do nothing in (T + 1)th step.

In order to understand the above process of information spreading, we give one example to illustrate this process (see Fig. 2). Figure 2 is an example for the spreading process of information A and B.

Figure 2.

Figure 2

An example for the spreading process of information A and B on one network. Arrows indicate that information is spread from one node to another, and single arrow and double arrows represent the spread of A and B, respectively.

Firstly, u and v are the nodes where information A and B begin to spread, respectively.

Let IA=IB=0.6, IA(v1)=IB(v1)=0.8, IA(v2)=IB(v2)=0.2, IA(v3)=IB(v3)=0.3, IA(v4)=IB(v4)=0.5, IA(v5)=IB(v5)=0.4, IA(v6)=IB(v6)=0.4, IA(v7)=IB(v7)=0.5, IA(v8)=IB(v8)=0.3, IA(v9)=IB(v9)=0.2, IA(v10)=IB(v10)=0.8.

Then, the spreading process includes five steps (when β=-1) or six steps (when β=1 or 0).

First step: no matter what the value of β is (β=-1, 1 or 0),

IA(v1)=0.8>0.6=IA, IB(v4)=0.5<0.6=IB, IA(v5)=0.4<0.6=IA, IB(v6)=0.4<0.6=IB, IA(v7)=0.5<0.6=IA, IB(v10)=0.8>0.6=IB.

Then, v1 accepts A, v10 accepts B.

Second step: no matter what the value of β is (β=-1, 1 or 0),

IA(v2)=0.2<0.6=IA, IA(v5)×[1×(2-1)+1]=0.4×2=0.8>0.6=IA, IB(v9)=0.2<0.6=IB, IB(v6)×[1×(2-1)+1]=0.4×2=0.8>0.6=IB.

Then, v5 accepts A, v6 accepts B.

Similar to the calculation process of the First step and Second step, we can analyze the spreading results of the next four steps when β=1 or 0, and the next three steps when β=-1. In order to briefly describe the processes, here we only give the final spreading results:

  1. β=1 or 0: v1, v2, v5, v7, v8 accepts A, v3, v4, v6, v9, v10 accepts B;

  2. β=-1: v1, v5, v7, v8 accepts A, v3, v4, v6, v10 accepts B;

Preparations for simulation experiments

Next, through a large number of simulation experiments based on the above spreading model, we analyze the influence of various factors on the Cooperation and Competition in the information spreading.

Many real social network data33,34 can be used to analyze the topological characteristics of social networks and conduct research on spreading dynamics .

In this paper, we mainly carry out simulation experiments on the following three networks in Table 2.

Table 2.

Some topological characteristics of three background networks.

Networks Node number Edge number Diameter Average clustering coefficient
G1 63,731 817,035 15 0.148
G2 39,199 87,415 17 0.082
G3 81,306 1,768,149 7 0.565

Some topological characteristics of these three networks are listed in Table 2.

  1. Network G1: A real social network35, which contains friendship data of Facebook users, comprises 63,731 nodes and 817,035 edges: a node represents a user and an edge represents a friendship between two users. The data set of network can be downloaded from the following websites: http://konect.uni-koblenz.de/networks/facebook-wosn-links

  2. Network G2: A social network from Filmtipset.se37 is a Swedish movie rating website. Nodes in the network are users of the website and edges represent friendship. The data set of network can be downloaded from the following websites: http://konect.uni-koblenz.de/networks/filmtipset_friend

  3. Network G3: This social network38 contains Twitter data, which comprises 817,035 nodes and 1,768,149 edges. The data set of network can be downloaded from the following websites: http://snap.stanford.edu/data/ego-Twitter.html

Then we analyze the simulation experiments of information spreading on network G1, G2 and G3. Because there are too many simulation results on each network, and the corresponding simulation process and results are similar, we put the simulation results on network G2 and G3 into the Supplementary information.

Results

Next, we choose the network G135 as the background network of information spreading, and perform our spreading model on G1 to simulate and analyze the influence of three factors (distance (d) between two information sources, social reinforcement (c) and human heterogeneity) on Cooperation and Competition.

In order to more clearly explain the influence of various factors on Cooperation and Competition, we give some symbols and explain them in Table 3.

Table 3.

The definition of some symbols in the paper.

Symbol Definition
η0 The coverage of information spreading on the network when β=0
η-1 The coverage of information spreading on the network when β=-1
η1 The coverage of information spreading on the network when β=1
Δη-1(=η-1-η0) Difference value of the coverage of information spreading on the network when β=-1 and β=0
Δη1(=η1-η0) Difference value of the coverage of information spreading on the network when β=1 and β=0

Obviously, Δη-1<0 indicates that there is Competition among information in information spreading, while Δη1>0 indicates that there is Cooperation among information in information spreading.

To discuss the influence of human heterogeneity in information spreading, we consider three cases on the distribution of individual attribute as follows.

Let P{IL(v)=x} denotes the probability that the individual attribute IL(v) of randomly selected individual v is equal to x.

Case 1: IL(v) obeys normal distribution N(0.5,0.152), i.e IL(v)N(0.5,0.152);

Case 2: IL(v) obeys uniform distribution U(0, 1), i.e IL(v)U(0,1);

Case 3: Let n2 be an integer and X = {in|i=1,2,...,n}. For any x(0,1], there is an integer i (1in) such that i-1n<xin and IL(v) obeys power-law distribution with power exponent λ (λ1), i.e P{IL(v)=x|i-1n<xin}=ai-λ, and a=1/(1-λ+2-λ++n-λ). In order to simplify the expression, in the following contents of this paper, the power-law distribution is recorded as Pow(λ), where λ is the power index.

Although there is no data on human heterogeneity, and it is not clear what kind of distribution individual attributes will satisfy, this paper selects three common distributions in the real world36: Normal distribution, Uniform distribution and Power Law distribution as the distribution of individual attributes to study the influence of human heterogeneity in information spreading.

For individual attribute, the degree of dispersion reflects the intensity of human heterogeneity: the greater the degree of dispersion is, the stronger the human heterogeneity is.

There are two statistical variables used to measure the degree of dispersion:

  1. Standard Deviation (SD) For a single set of data, the Standard Deviation can reflect its dispersion. The greater the Standard Deviation is, the greater the degree of dispersion is.

  2. Coefficient of Variation (CV) For two or more sets of data, the Coefficient of Variation can be used to compare their dispersion. The greater the Coefficient of Variation is, the greater the degree of dispersion is. The Coefficient of Variation is equal to the ratio of Standard Deviation to Mean.

Therefore, for the sample data of individual attribute, we calculate the Coefficient of Variation to compare the intensity of human heterogeneity: the greater the Coefficient of Variation is, the stronger the human heterogeneity is; otherwise, the smaller the Coefficient of Variation is, the weaker the human heterogeneity is.

In order to analyze the influence of human heterogeneity, we consider that individual attribute IL(v) obey six probability distributions in this paper. Using the above conclusion “the greater the Coefficient of Variation is, the stronger the human heterogeneity is” and the data of Coefficient of Variation in Table 4, the order of human heterogeneity in these distributions is:

Table 4.

Statistical characteristics of individual attribute in network G1 subject to different distribution.

Individual Attribute Mean (M) Standard Deviation (SD) Coefficient of Variation (CV=SD/M)
N(0.5,0.152) 0.50 0.15 0.30
U(0, 1) 0.50 0.29 0.58
Pow(0.25) 0.44 0.30 0.68
Pow(0.5) 0.36 0.30 0.83
Pow(0.75) 0.27 0.28 1.04
Pow(1.0) 0.19 0.24 1.26

Pow(1.0)>Pow(0.75)>Pow(0.5)>Pow(0.25)>U(0,1)>N(0.5,0.152).

As shown in Fig. 3, it is the box plot of individual attribute in network G1 subject to different distributions.

Figure 3.

Figure 3

Box plot of individual attribute in network G1 subject to different distribution.

Next, the simulation experiments to analyze the influence of factors on Cooperation and Competition are divided into three parts “The influence of distance between two information sources”, “The influence of social reinforcement”, “The influence of human heterogeneity”.

The influence of distance between two information sources

We firstly analyze the influence of distance between two information sources on the Cooperation and Competition in information spreading.

Design of simulation experiments in Fig. 4

Figure 4.

Figure 4

The influence of distance between two sources on Cooperation and Competition in information spreading. The parameters setting in the simulation experiments is: (a) c=1.0, IA(v)N(0.5,0.152), IB(v)N(0.5,0.152); (b) c=1.0, IA(v)U(0,1), IB(v)U(0,1); (c) c=1.0, IA(v)Pow(1.0), IB(v)Pow(1.0). The greater the absolute value of Δη-1 (Δη1) is, the stronger the Cooperation (Competition) between information is.

When the individual attribute obeys certain distribution (such as Fig. 4a, IA(v)N(0.5,0.152) and IB(v)N(0.5,0.152)), the following simulation experiments are carried out for each group of individual attribute generated by all individuals on the network:

  1. Design of single simulation experiment: choose two nodes as two information sources, from these two nodes to spread information to their neighbors, and finally get the coverage of information spreading. For each pair of nodes, we carry out three such simulation experiment (in which the social reinforcement c is fixed, and c=1.0 in Fig. 4): β=0, β=-1 and β=1, and then calculate Δη-1 and Δη1.

  2. Summary of results: all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) are accumulated and added respectively, and then the average value is taken.

Finally, 100 groups of individual attribute (i.e., the above process (1) and (2) are generated together for 100 times). Then all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) are cumulatively added and then the average value is taken.

Figure 4 presents the following results:

  1. When the distance (d) between two information sources is small, Δη-1<0 and Δη1>0. So there is Cooperation and Competition in information spreading.

  2. The smaller the distance (d) between two information sources is, the greater the absolute value of Δη-1 is, that is, the stronger the Competition between information is.

  3. The smaller the distance (d) between two information sources is, the greater the absolute value of Δη1 is, that is, the stronger the Cooperation between information is.

The influence of social reinforcement

Next, we analyze the influence of social reinforcement on the Cooperation and Competition in information spreading.

Design of simulation experiments in Fig. 5

Figure 5.

Figure 5

The influence of social reinforcement on Cooperation and Competition in information spreading. The parameters setting in the simulation experiment is following. (a1) and (a2): IAN(0.5,0.152), IBN(0.5,0.152); (b1) and (b2): IAU(0,1), IBU(0,1); (c1) and (c2): IAPow(1.0), IBPow(1.0). (a1), (b1) and (c1): analyze the influence of social reinforcement on Competition (that is, to analyze the change of Δη-1), and the darker the color in the heat map (that is, the smaller the value of Δη-1 is), the stronger the Competition between information is; (a2), (b2) and (c2): analyze the influence of social reinforcement on Cooperation (that is, to analyze the change of Δη1), and the lighter the color in the heat map (that is, the greater the value of Δη1 is), the stronger the Cooperation between information is.

When the individual attribute obeys certain distribution (such as Fig. 5 (a1) and (a2), IA(v)N(0.5,0.152) and IB(v)N(0.5,0.152)), the following simulation experiments are carried out for each group of individual attribute generated by all individuals on the network:

  1. Design of single simulation experiment: choose two nodes as two information sources, from these two nodes to spread information to their neighbors, and finally get the coverage of information spreading. For each value of social reinforcement c and each pair of nodes, we carry out three such simulation experiment: β=0, β=-1 and β=1, and then calculate Δη-1 and Δη1.

  2. Summary of results: all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) and the same social reinforcement are accumulated and added respectively, and then the average value is taken.

Finally, 100 groups of individual attribute (i.e., the above process (1) and (2) are generated together for 100 times).Then all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) and the same social reinforcement are cumulatively added and then the average value is taken.

Figure 5 presents the following results:

  1. When the distance (d) between the two information is fixed, the greater the value of social reinforcement (c) is, the greater the absolute values of Δη-1 is; that is, the greater the value of c is, the stronger the Competition between information is.

  2. When the distance (d) between the two information is fixed, the greater the value of social reinforcement (c) is, the greater the absolute values of Δη1 is; that is, the greater the value of c is, the stronger the Cooperation between information is.

The influence of human heterogeneity

Finally, we analyze the influence of human heterogeneity on the Cooperation and Competition in information spreading. In order to analyze the influence of human heterogeneity in information spreading more systematically and deeply, we divide the simulation analysis into two parts: “The influence of human heterogeneity on spreading of single information” and “The influence of human heterogeneity on spreading of multiple information”.

The influence of human heterogeneity on spreading of single information

We first analyze the influence of human heterogeneity in information spreading when a single information is spread on the network.

In order to analyze the influence of human heterogeneity, individual attribute obeys six probability distributions in the following simulation experiments. From the above results, we find that the order of human heterogeneity in these distributions is: Pow(1.0)>Pow(0.75)>Pow(0.5)>Pow(0.25)>U(0,1)>N(0.5,0.152).

Design of simulation experiments in Fig. 6

Figure 6.

Figure 6

The influence of human heterogeneity in information spreading when a single information is spread on the network. The parameter setting in the simulation experiments is: c=1.0.

We randomly select 50 nodes from the network, and carry out the following simulation experiments from each of these nodes:

  1. When the individual attribute obeys a certain distribution, the simulation experiment is carried out for each group of individual attribute generated by all nodes of the network: a node as the information source, from this node to spread information to his neighbors, and finally get the coverage of information spreading in each step. 100 sets of individual attribute are generated together (i.e., the process is performed 100 times).

  2. results summary: all simulation results (i.e., the values of η) with the same distribution for individual attribute and the same spreading time are cumulatively added and then the average value is taken.

According to Fig. 6, we find that: the stronger the human heterogeneity is (that is, the greater the Coefficient of Variation (CV) for individual attribute is), the smaller the coverage of information spreading is.

The influence of human heterogeneity on spreading of multiple information

Then we analyze the influence of human heterogeneity on the Cooperation and Competition in information spreading when two kinds of information are spread on the network.

Design of simulation experiments in Fig. 7

Figure 7.

Figure 7

The influence of human heterogeneity on Cooperation and Competition in information spreading when two kinds of information are spread on the network. The parameter setting in the simulation experiment is: c=1.0. (a) analyze the influence of social reinforcement on Competition (that is, to analyze the change of Δη-1); (b) analyze the influence of social reinforcement on Cooperation (that is, to analyze the change of Δη1).

When the individual attribute corresponding to one information is subject to a certain distribution (the distribution is fixed, such as IA(v)N(0.5,0.152) in Fig. 7), and the other information is subject to a certain distribution in six distributions, the following simulation experiments are carried out for each group of individual attribute generated by all individuals on the network:

  1. Design of single simulation experiment: choose two nodes as two information sources, from these two nodes to spread information to their neighbors, and finally get the coverage of information spreading. For each pair of nodes, we carry out three such simulation experiment (in which the social reinforcement c is fixed, and c=1.0 in Fig. 7): β=0, β=-1 and β=1, and then calculate Δη-1 and Δη1.

  2. Summary of results: all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) are accumulated and added respectively, and then the average value is taken.

Finally, 100 groups of individual attribute (i.e., the above process is generated for 100 times).Then all simulation results (i.e., the values of Δη-1 and Δη1) with the same distance (the distance between two sources) are cumulatively added and then the average value is taken.

In order to further analyze the influence of human heterogeneity, in the following simulation experiments, the individual attribute of information A is subject to Normal distribution, while the individual attribute of information B is subject to Normal distribution, Uniform distribution, and Power Law distribution. So we can analyze the influence of B on A in information spreading, that is, the influence of different human heterogeneity on Cooperation and Competition. Figure 7 presents the following results:

  1. When the social reinforcement (c) and distance (d) between two information are fixed, the greater the Coefficient of Variation (CV) of individual attribute for information B, the greater the absolute value of Δη-1 for information A is. That is, the weaker the human heterogeneity for one information is, the stronger the Competition between this information and other information is.

  2. When the social reinforcement (c) and distance (d) between two information are fixed, the greater the Coefficient of Variation (CV) of individual attribute for information B, the greater the absolute value of Δη1 for information A is. That is, the weaker the human heterogeneity for one information is, the stronger the Cooperation between this information and other information is.

Conclusions and discussion

In this paper, we study Cooperation and Competition in information spreading. Through simulation experiments on real social networks, we propose a new spreading model and analyze the influence of interaction between information in information spreading. We analyze the influence of three factors (distance between two information sources, social reinforcement, human heterogeneity) on Cooperation and Competition between two kinds of information.

Through a large number of simulation experiments, we find that:

  1. When multiple information are spread on social networks, there is Cooperation and Competition between these information.

  2. The smaller the distance (d) between two information sources is, the stronger the Cooperation and Competition between these information are.

  3. The greater the value of social reinforcement (c) is, the stronger the Cooperation and Competition between these information are.

  4. The weaker the human heterogeneity for one information is, the stronger the Cooperation and Competition between this information and other information are.

The results in this paper will help us to better understand the spread of multiple information on social networks, and the key factors that affect the Cooperation and Competition between multiple information, which can provide some theoretical guidance for the maximum information spreading (such as innovations, opinions, fads) and control of information spreading (such as rumors, viruses). In addition, although this paper only studies two kinds of information on social networks, our research methods and analysis ideas can be applied to the research of more than two kinds of information on social networks.

Supplementary information

Acknowledgements

This work is supported by The Fundamental Research Funds for the Central Universities (2662015BQ047, 2662018JC014).

Author contributions

All of the authors Z.Z., C.G., Y.Z., H.L., J.X., Y.Z. and Z.L. have made great contributions to the completion of the paper, and we have completed it together. Among them, Z.Z. is responsible for the conception and writing of the whole paper, with the most contributions; C.G., Y.Z., H.L., J.X., Y.Z. and Z.L. have made great contributions in the simulation experiments and experimental analysis.

Data availability

All network datasets in this study are available from KONECT (http://konect.uni-koblenz.de/networks/facebook-wosn-links, http://konect.uni-koblenz.de/networks/filmtipset_friend) and SNAP (http://snap.stanford.edu/data/ego-Twitter.html).

Competing interests

The authors declare no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

is available for this paper at 10.1038/s41598-020-69098-5.

References

  • 1.Peng C, Xu K, Wang F, Wang HY. Predicting information diffusion initiated from multiple sources in online social networks. Int. Symp. Comput. Intell. Des. 2013;2:96–99. [Google Scholar]
  • 2.Jin F, et al. Epidemiological modeling of news and rumors on Twitter. Workshop Soc. Netw. Min. Anal. 2013;8:1–9. [Google Scholar]
  • 3.Guille A, Hacid H, Favre C, Zighed DA. Information diffusion in online social networks: a survey. ACM Sigmod Record. 2013;42:17–28. doi: 10.1145/2503792.2503797. [DOI] [Google Scholar]
  • 4.Su Y, Zhang X, Liu L, Song SY, Fang BX. Understanding information interactions in diffusion: an evolutionary game-theoretic perspective. Front. Comput. Sci. 2016;10:518–531. doi: 10.1007/s11704-015-5008-y. [DOI] [Google Scholar]
  • 5.Dai WH, Hu HZ, Wu TN, Dai YH. Information spread of emergency events: path searching on social networks. Sci. World J. 2014;2014:179620. doi: 10.1155/2014/179620. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Alsuwaidan L, Ykhlef M. Information diffusion predictive model using radiation transfer. IEEE Access. 2017;5:25946–25957. doi: 10.1109/ACCESS.2017.2764001. [DOI] [Google Scholar]
  • 7.Liu T, Li P, Chen Y, Zhang J. Community size effects on epidemic spreading in multiplex social networks. PLoS ONE. 2016;11:e0152021. doi: 10.1371/journal.pone.0152021. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 8.Stegehuis C, van der Hofstad R, van Leeuwaarden JSH. Epidemic spreading on complex networks with community structures. Sci. Rep. 2016;6:29748. doi: 10.1038/srep29748. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Dai Z, Li p, Chen Y, Zhang K, Zhang J. Influential node ranking via randomized spanning trees. Phys. A Stat. Mech. Appl. 2019;526:120625. doi: 10.1016/j.physa.2019.02.047. [DOI] [Google Scholar]
  • 10.Vega-Oliveros DA, Zhao L, Berton L. Evaluating link prediction by diffusion processes in dynamic networks. Sci. Rep. 2019;9:10833. doi: 10.1038/s41598-019-47271-9. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 11.Lin YS, Chen W, Lui JCS. Boosting information spread: an algorithmic approach. IEEE. 2018;5:344–357. [Google Scholar]
  • 12.Mislove, A., Marcon, M. & Gummadi, K. P. Measurement and analysis of online social networks. InInternet Measurement Conference 29–42 (ACM, 2007).
  • 13.Chiu P, Cheung C, Lee M. Online social networks: why do we use facebook? Commun. Comput. Inf. Sci. 2008;19:67–74. [Google Scholar]
  • 14.Zhang ZK, et al. Dynamics of information diffusion and its applications on complex networks. Phys. Rep. 2016;651:1–34. doi: 10.1016/j.physrep.2016.07.002. [DOI] [Google Scholar]
  • 15.Watts DJ. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. 2002;99:5766–5771. doi: 10.1073/pnas.082090499. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16.Nematzadeh A, Ferrara E, Flammini A, Ahn YY. Optimal network modularity for information diffusion. Phys. Rev. Lett. 2014;113:088701. doi: 10.1103/PhysRevLett.113.088701. [DOI] [PubMed] [Google Scholar]
  • 17.Gruhl, D., Guha, R., Liben-Nowell, D. & Tomkins, A. Information diffusion through blogspace. In Proceedings of the 13th ACM International Conference 491–501 (2007).
  • 18.Goldenberg J, Libai B, Muller E. Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 2001;12:211–223. doi: 10.1023/A:1011122126881. [DOI] [Google Scholar]
  • 19.Myers SA, Leskovec J. Clash of the contagions: cooperation and competition in information diffusion. IEEE. 2012;1:539–548. [Google Scholar]
  • 20.Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. ACM. 2003;4:137–146. [Google Scholar]
  • 21.Leskovec, J. et al.Cost-effective outbreak detection in networks 420–429 (ACM, 2007).
  • 22.Lü LY, et al. Vital nodes identification in complex networks. Phys. Rep. 2016;650:1–63. doi: 10.1016/j.physrep.2016.06.007. [DOI] [Google Scholar]
  • 23.Zhan XX, et al. Coupling dynamics of epidemic spreading and information diffusion on complex networks. Appl. Math. Comput. 2018;332:437–448. doi: 10.1016/j.amc.2018.03.050. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24.Liu C, Zhan XX, Zhang ZK, Sun GQ, Hui PM. How events determine spreading patterns: information transmission via internal and external influences on social networks. New J. Phys. 2015;17:113045. doi: 10.1088/1367-2630/17/11/113045. [DOI] [Google Scholar]
  • 25.Dodds PS, Watts DJ. Universal behavior in a generalized model of contagion. Phys. Rev. Lett. 2004;92:218701. doi: 10.1103/PhysRevLett.92.218701. [DOI] [PubMed] [Google Scholar]
  • 26.Centola D. The spread of behavior in an online social network experiment. Science. 2010;329:1194–1197. doi: 10.1126/science.1185231. [DOI] [PubMed] [Google Scholar]
  • 27.Medo M, Zhang YC, Zhou T. Adaptive model for recommendation of news. Europhys. Lett. 2009;88:38005. doi: 10.1209/0295-5075/88/38005. [DOI] [Google Scholar]
  • 28.Cimini G, Medo M, Zhou T, Zhang YC. Heterogeneity, quality, and reputation in an adaptive recommendation model. Eur. Phys. J. B. 2011;80:201–208. doi: 10.1140/epjb/e2010-10716-5. [DOI] [Google Scholar]
  • 29.Wei D, et al. Effective mechanism for social recommendation of news. Phys. A Stat. Mech. Appl. 2011;390:2117–2126. doi: 10.1016/j.physa.2011.02.005. [DOI] [Google Scholar]
  • 30.Krapivsky PL, Redner S, Volovik D. Reinforcement-driven spread of innovations and fads. J. Stat. Mech. Theory E. 2011;12:12003. doi: 10.1088/1742-5468/2011/12/P12003. [DOI] [Google Scholar]
  • 31.Lü LY, Chen DB, Zhou T. The small world yields the most effective information spreading. New J. Phys. 2011;13:825–834. [Google Scholar]
  • 32.Zhu ZQ, Liu C. J., Wu J. L, Xu J., Liu B. The influence of human heterogeneity to information spreading. J. Stat. Phys. 2014;154:1569–1577. doi: 10.1007/s10955-014-0924-z. [DOI] [Google Scholar]
  • 33.Leskovec, J. http://snap.stanford.edu/data/.
  • 34.The Koblenz network collection. http://konect.uni-koblenz.de.
  • 35.Viswanath B, Mislove A, Cha M, Gummadi KP. On the evolution of user interactions in facebook. ACM. 2009;39:37–42. [Google Scholar]
  • 36.DeGroot MH, Schervish MJ. Probability and Statistics. 4. Beijing: China Machine Press; 2012. [Google Scholar]
  • 37.Said, A., De Luca, E. W. & Albayrak, S. How social relationships affect user similarities. In Proceedings of 2010 Workshop on Social Recommender Systems (2010).
  • 38.McAuley, J. & Leskovec, J. Learning to discover social circles in ego networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems (2012).

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Data Availability Statement

All network datasets in this study are available from KONECT (http://konect.uni-koblenz.de/networks/facebook-wosn-links, http://konect.uni-koblenz.de/networks/filmtipset_friend) and SNAP (http://snap.stanford.edu/data/ego-Twitter.html).


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES