Shuo Han, Fuzhen Zhuang, Qing He, Zhongzhi Shi, Xiang Ao

Size: px
Start display at page:

Download "Shuo Han, Fuzhen Zhuang, Qing He, Zhongzhi Shi, Xiang Ao"

Transcription

1 Accepted Manuscript Energy model for rumor propagation on social networks Shuo Han, Fuzhen Zhuang, Qing He, Zhongzhi Shi, Xiang Ao PII: S (13)968- DOI: Reference: PHYSA To appear in: Physica A Received date: 3 May 213 Revised date: 4 September 213 Please cite this article as: S. Han, F. Zhuang, Q. He, Z. Shi, X. Ao, Energy model for rumor propagation on social networks, Physica A (213), This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

2 Highlights: We propose a novel model for rumor propagation based on physical theory. The proposed model shows rumor propagation experiences three evolutionary stages. We investigate why some weakening rumors can get resurgence. The proposed model shows different people have different effects on rumor propagation. We study the impacts of some influencing factors on the dynamics of rumor propagation.

3 *Manuscript Click here to view linked References Energy Model for Rumor Propagation on Social Networks Shuo Han a,b,, Fuzhen Zhuang a, Qing He a, Zhongzhi Shi a, Xiang Ao a,b, a The Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 119, China b University of Chinese Academy of Sciences, Beijing 149, China Abstract With the development of social networks, the impact of rumor propagation on human lives is more and more significant. Due to the change of propagation mode, traditional rumor propagation models designed for word-of-mouth process may not be suitable for describing the rumor spreading on social networks. To overcome this shortcoming, we carefully analyze the mechanisms of rumor propagation and the topological properties of large-scale social networks, then propose a novel model based on the physical theory. In this model, heat energy calculation formula and Metropolis rule are introduced to formalize this problem and the amount of heat energy is used to measure a rumor s impact on a network. Finally, we conduct track experiments to show the evolution of rumor propagation, make comparison experiments to contrast the proposed model with the traditional models, and perform simulation experiments to study the dynamics of rumor spreading. The experiments show that 1) the rumor propagation simulated by our model goes through three stages: rapid growth, fluctuant persistence and slow decline; 2) individuals could spread a rumor repeatedly, which leads to the rumor s resurgence; 3) rumor propagation is greatly influenced by a rumor s attraction, the initial rumormonger and the sending probability. Keywords: Rumor propagation, Energy Model, Social networks, Heat calculation formula, Metropolis rule Corresponding author. Tel.: address: hans@ics.ict.ac.cn (Shuo Han) Preprint submitted to Physica A September 4, 213

4 1. Introduction A rumor, as a form of social communication, widely exists in human lives. As it always involves influential events such as political and economic issues or public figures, a rumor can easily shape public opinion, cause panic, harm others and has significant impacts on society. For example, last year, there was a rumor that the earth would experience three days of darkness during the end of world spreading in some districts of China. Some people believed it and stocked up on candles, which led to a temporary supply shortage of candles. Traditionally, a rumor spreads by word of mouth. However, as information technology develops, computer-mediated communication is becoming a major way of information dissemination. There are some new characteristics of rumor propagation emerging on social networks such as fast velocity, wide extent and liable to repetition, that bring new challenges to this problem. Rumor propagation has attracted many researchers great attention and there are several classical models on it found in the literatures. Since rumor spreading could be regarded as a social contagion process [1], early scholars borrowed epidemic models to describe this phenomenon [2, 3, 4]. However, epidemic models are not specially designed for rumor propagation and the mean-field rate equations are too simple to depict its complex evolution accurately. Subsequently, Zhao et al. improved epidemic models and applied them to rumor spreading on social networks [5, 6]. Nonetheless, they still didn t overcome the natural flaws of epidemic models. Galam proposed a novel model called Galam s Model to simulate rumor propagation [7]. And then Ellero et al. introduced a new scheme to improve Galam s Model[8]. Nevertheless, these models are confined to word-of-mouth information exchanging and are not suitable for describing rumor spreading on large-scale social networks. Zhang et al. investigated the interplay between rumor propagation and emergency development [9, 1, 11]. However, their work focused on studying the strategy to minimize negative impacts of rumor propagation instead of modeling the evolution. Reviewing the existing work, we find that the mechanisms of rumor propagation in most of the current models are designed by macromethod but are lacking in the following important details. Firstly, a rumor s attraction to people always presents a downtrend and such characteristic should be described in the model. Secondly, different individuals have different capabilities to transmit a rumor to others. In large-scale networks, high-degree 2

5 nodes usually have more authorities to influence other nodes [12]. Thirdly, the probability that an individual transmits a rumor to others is not constant. When people first hear a rumor, they are active to share it with others. However, as people lose interest in the rumor gradually, the transmit probability correspondingly decreases. Based on these observations, we analyze this problem from five aspects, including the characteristics of a rumor, the impact of a rumor on an individual, the accumulation of an individual s energy, the impact of a rumor on a network and the rules of rumor transmission. Along this line, we introduce the physical theory to analogize and formalize rumor propagation. Specifically, we find a rumor s influence involves three factors, i.e. the rumor s attraction, the infected individual s authority and the infected individual s discriminability of the rumor. Then we adopt the heat energy calculation to formalize their relationship. We also use simulated annealing schedule to describe the characteristics of a rumor and apply the property of Metropolis rule to formulating the rumor transmit probability. Finally we integrate these physical theories to propose a novel model called Energy Model for simulating rumor propagation. In addition, we systemically conduct experiments on both synthetic and real-world data sets to evaluate the performance of the proposed model for simulating rumor spreading and investigate the dynamics of rumor propagation. The rest of the paper is organized as follows. In Section 2, we state the problem and introduce some preliminary knowledge related to our work. In Section 3, we expound our model including the design methodology and algorithmic details. In Section 4, we perform experiments on both synthetic data sets and real data sets to visualize the evolution of rumor propagation and study its dynamic characteristics. Finally we conclude this paper in Section Problem Statement and Preliminary Knowledge To better understand the proposed model and comprehend how we apply the physical theory to analogize and formalize rumor propagation, we introduce the problem statement and preliminary knowledge here Problem Statement The problem statement of rumor propagation could usually be defined as follows [13]. Consider a population formed by N individuals where some of them may have closed relationships and each individual can be in one 3

6 of three different possible states: an ignoramus who has not yet heard the rumor, a spreader who is trying to spread the rumor to his neighbors, a stifler who no longer believes or spreads the rumor. Initially, only one individual is rumormonger and the remainder are ignoramuses. And in the subsequent time steps, the rumor spreads in the network by some certain mechanisms. Our work is to build a model to simulate this phenomenon and discuss its dynamic characteristics Preliminary Knowledge Heat Energy Calculation Substances absorb or release thermal energy when the temperature of surrounding changes. In physics, the amount of heat energy transfer is determined by three factors, i.e., mass, heat capacity and temperature change. Their relationship is defined by heat calculation formula as follows. E = cm T, (1) where E is the amount of heat energy transfer, m is mass, c is heat capacity and T is temperature change. In this paper, we analogy that rumors bring effects to individuals is similar to substances absorb or release thermal energy. Their correlation and how we incorporate heat energy calculation into the proposed model will be detailed in Section Metropolis Rule As we mentioned above, the probability that an individual transmits a rumor to others is not constant. A rumor is a kind of misinformation or disinformation and has always not been verified in the beginning of rumor propagation [14]. And it is also eye-catching so that can easily have people believe it and irrationally spread it as soon as they hear it [15]. Therefore, the rumor transmit probability is usually large in the beginning of rumor propagation. However, as time goes on, a rumor may be officially refuted or swallowed by other information. People no longer believe it or gradually lose interest in it. The transmit probability thus decreases. Based on these analyses, in our paper, we assume that the rumor transmit probability for an individual is large at the beginning and then decreases gradually. And we apply the form of Metropolis rule to formulating this probability. The 4

7 Metropolis rule can be expressed as follows. { 1 if E(x new ) < E(x old ), P = exp( (E(x new ) E(x old ))/T ) if E(x new ) E(x old ), (2) where P is the probability of making the transition from state x old to state x new, E(x) is the energy of state x, and T is the current temperature of system [16]. The expression of Metropolis rule has two properties. Firstly, if E(x new ) < E(x old ), the probability P is 1. Otherwise, the probability P is a value less than 1. Secondly, the probability P decreases with the decrease of the temperature T. And in simulated annealing algorithm, the temperature T is represented as a decreasing function called annealing schedule, that guarantees the probability P remains in a large value at the initial stage and then decreases gradually [17]. In our model, we use E(x) to indicate a rumor s impact on an individual, and use T to indicate a rumor s attraction which is also defined as a decreasing function. Based on the property of Metropolis rule, the transmit probability is in accord with the above assumption that it is a large value in the beginning of rumor propagation, and then decreases as the rumor s attraction fades away. The detailed rule design and explanation will be elaborated in Section Model of Rumor Propagation In this section, we analyze rumor propagation from five aspects and propose a novel model to describe this phenomenon based on the physical theory, called Energy Model. We first detail the design mechanisms of the proposed model, and then analyze its advantages compared with the traditional models Energy Model Motivated by the observations mentioned in Section 1, there are five aspects need to be studied in our model: the characteristics of a rumor, the impact of a rumor on an individual, the accumulation of an individual s energy, the impact of a rumor on a network and the rules of rumor transmission. 5

8 The characteristics of a rumor A rumor is often viewed as an unverified account or explanation of events spreading in population and pertaining to an object or issue in public concern [14]. It is usually eye-catching and has not been verified in the beginning of rumor propagation so that it has much attraction to people when they first hear it [14, 15]. At the meantime, most rumors have their timelines, they will extinct if they are officially refuted or swallowed by other information. Thus, as time goes on, a rumor s attention usually fades away gradually. Consequently, we think the attraction of a rumor to an individual is large initially and then exhibits a downtrend. Such characterization of a rumor is similar to the annealing in physics. Referring to the simulated annealing schedules in simulated annealing algorithm [16], we could define a rumor s attraction as T (t) = T / lg(1 + t), (3) where T is the initial temperature and t is the time step. T indicates a rumor s initial attraction, that is, the larger the value is, the more attractive the rumor is. According to the expression, the attraction of a rumor declines as the time step goes on. In addition, to depict different rumors, the form of a rumor s attraction expression could be various as long as it is monotonously decreasing. Note that, in our paper, we model the characteristics of a rumor from a microcosmic view. For example, individual A accepts a rumor at time step t, the attraction of the rumor to individual A at time step t is a large value and it decreases in the subsequent time steps. Individual A transmits the rumor to individual B at time step t+k, the attraction of the rumor to individual B at time step t+k is a large value and then it decreases. In other word, the attraction of a rumor to different people is asynchronous The impact of a rumor on an individual In our model, considering a rumor brings effects to an individual is similar to substance absorbs thermal energy, we introduce heat energy calculation to analogize and formalize the impact of a rumor on an individual. Specifically, we use the amount of heat energy transfer to indicate a rumor s impact on an individual, use the mass to indicate an individual s authority, use the heat capacity to indicate an individual s discriminability of a rumor, and use the temperature to indicate a rumor s attraction. Moreover, an individual s 6

9 authority can be expressed as the number of its neighbors (also referred as the degree in undirected networks and the out-degree in directed networks), and the larger the value is, the stronger transmission capability the individual has. An individual s discriminability of a rumor means how much degree he trusts the rumor, in this paper, the value is sampled from the range [, 1]. The rumor s attraction is formalized as Eq.(3), which is a function of time step t. To sum up, the energy transfer expression for an individual could be defined as E(t) = cm T (t). (4) For an ignoramus, his temperature is. He gets energy as long as he accepts the rumor. Therefore, we can rewrite the energy expression as E(t) = cmt (t), (5) where E(t) is a rumor s impact on an individual at time step t, c is an individual s discriminability of a rumor, m is an individual s degree, T (t) is a rumor s attraction at time step t. The definition shows the impact of a rumor on an individual changes over time. From the expression, we find that hub nodes (with large connection degree) infected by a rumor can bring huger effects than common nodes (with small connection degree), which is called celebrity effect The accumulation of an individual s energy Energy Model permits individuals spread and accept rumor repeatedly. Each acceptance can increase the individual s energy and such accumulation satisfies diminishing returns property [18]. Supposed an individual has accepted a rumor j times before time step t j, then the energy accumulation function can be defined as E(t) = j E(t j )/j, (6) where E(t j )/j denotes the energy increment brought by the j-th rumor acceptance. Eq.(6) indicates that an individual may become more active if more of his neighbors send the rumor to him. And the marginal effect of each acceptance decreases as the number of the acceptances increases. Note that, although Eq.(6) expresses the accumulation of an individual s energy, it doesn t mean that it is a monotonically increasing function. When an individual accepts a rumor at some time, its energy will increase. 7

10 However, when it does not accept the rumor at other time, the energy will decrease, since both T (t j ) and E(t j ) are decreasing functions. Moreover, a spreader s transmit probability decreases over time, thus an individual is impossible to keep accepting the rumor from others forever. Finally, the accumulation satisfies diminishing returns property, that is, with the increase of the acceptances, the marginal increase of the energy accumulation decreases. Consequently, although Energy Model permits individuals to spread and accept rumor repeatedly, the impact of a rumor on an individual is not infinite The impact of a rumor on a network At a certain time step, we sum all the individuals energy values and get the current impact of a rumor on the whole network, E net (t) = N E i (t), (7) i=1 where E i (t) is the accumulated energy value of individual i at time step t The rules of rumor transmission In this model, we describe the interaction between individuals through two probabilities: sending probability and acceptance probability. Sending probability determines whether a spreader sends a rumor to his neighbors. In our model, this probability has two properties. Firstly, it is judged by a rumor s impacts on a spreader in current and previous two moments. At a certain time step, if the rumor s current impact on the spreader is larger than the previous one, the spreader will transmit the rumor with a high probability, otherwise, he will do with a low probability. Secondly, since a rumor is popular initially and then diminishes over time, the sending probability for a spreader should be large at the beginning and then decreases gradually. We describe these two properties with Metropolis rule and define the sending probability as follows. { p if E(t) E(t 1), P send = (8) p exp[(e(t) E(t 1))/T (t)] if E(t) < E(t 1), where E(t) indicates a rumor s impact on an individual at time step t, and T (t) indicates a rumor s attraction at time step t. 8

11 For the first property, (E(t) E(t 1)) implies the spreader accepted the rumor at the last time step, which makes him transmit the rumor with a high probability of p. On the contrary, (E(t) < E(t 1)) means the spreader has less interest in the rumor than before and transmits the rumor with a low probability of (p exp[(e(t) E(t 1))/T (t)]). For the second property, we have modeled the attraction of a rumor T (t) being a decreasing function. As we elaborated in Section 2.2.2, the property of Metropolis rule can guarantee that the transmit probability remains in a large value initially, and then decreases gradually. Acceptance probability determines whether an individual accepts a rumor from his neighbors. In the real world, high-degree nodes have more authorities to influence other nodes, but are not easy to be influenced by others. Kempe et al. propose an influence model called Weighted Cascade Model to describe this issue [12]. In this model, the acceptance probability depends on the connection degree of the accepter. And its definition is P acc = 1/d acc, (9) where P acc is the acceptance probability and d acc is the connection degree(also referred as the degree in undirected networks and the in-degree in directed networks) of the accepter. Most of the social networks have scale-free property [19], and the degree difference between hub nodes and common nodes is very large. The definition of acceptance probability implies that when high-degree nodes transmit a rumor to common nodes, the common nodes will accept the rumor with high probability. In contrast, when common nodes transmit a rumor to highdegree nodes, the high-degree nodes accept the rumor with small probability. Based on the above analyses and analogy, we could simulate the evolution of rumor propagation using Energy Model. It starts with only one spreader existing in the network and progresses as spreaders transmit the rumor to their neighbors. The interaction between individuals follows the rules of rumor transmission. During the process, if an ignoramus hears a rumor and doesn t accept it, his local energy is still zero, otherwise he turns to be a spreader and has energy calculated by Eq.(5) and Eq.(6). When a spreader s energy reduces to, he becomes a stifler. We regard the whole network as an energy system and use the amount of energy to measure the impact of a rumor on a network. As a rumor emerges, spreads and fades away, the energy of a network rises, sustains and decays. 9

12 3.2. Model Innovation Comparing Energy Model with the other traditional models, we think the proposed model could have the following three advantages: Most traditional models for rumor propagation [2, 5] neglect the complex microcosmic mechanisms of rumor spreading, including the characteristics of a rumor, the rules of rumor transmission and so on. While in our model, we analyze this problem from five microcosmic aspects and incorporate them into one integral model. Hence, the simulation of Energy Model is more similar to the real rumor propagation. Most existing models for information diffusion, including voter models [21, 22] and linear threshold models [12, 23, 18], treat all the nodes in the network as equals, and ignore the distinction between high-degree nodes and lowdegree nodes. While in our model, we introduce the connection degree of individuals to distinguish them, and set different individuals to have different heat capacities. Almost all the current models are discrete, which use a binary variable to record an individual whether or not get infected, and adopt infection rate to evaluate a rumor s influence. However, in reality, different people have different degrees of identifications to the same rumor. In addition, the spreaders who have different authorities usually have different impacts on society. Consequently, in our model we use energy value, which is a continuous quantity to measure a rumor s influence on social networks. At the meantime, since the energy expression is a continuous function of time step, the conversion from spreaders to stiflers in our model is a continuous process. We think a reasonable measure can help us monitor the rumor more accurately. 4. Experiments In this section, we first give a brief introduction of the data sets. Secondly we perform a track experiment to display the evolution of rumor propagation applying the proposed model. And then we make comparison experiments between Energy Model and other models referring to real rumor propagations. Finally, we study the dynamics of rumor propagation by discussing the impact factors of rumor spreading. 1

13 4.1. Data Set There are four data sets used in the experiments, summarized in Table 1. The first one is a synthetic data set, which is generated using BA model [24, 25]. These data could construct a small undirected scale-free network shown at the top left corner of Figure 1, where the vertexes denote individuals and the lines represent the closed relationships of two individuals. Through this data set, we can conveniently follow the track of rumor propagation. The second one is crawled from Sina Weibo 1, which is a Chinese microblog service with Twitter-like unidirectional following relationships. It consists of two subsets and each one records the data of a real rumor spreading. From this data set, we can observe the trend of real rumor propagation. The third one is also a synthetic data set, which is generated using KR model [26]. This data set has a comparative scale to that of the second data set and can construct a directed scale-free network. We adopt it for comparison experiments to show the simulation results of different rumor models. Finally, the fourth data set crawled from Twitter, contains users and their following relationships. It is a real-world directed social network. We run the proposed model on it to study the dynamics of rumor propagation. Table 1: Introduction of Data Sets No. Scale Direction Source Usage 1 2 nodes undirected BA model Section nodes; 595 nodes directed Sina Weibo Section nodes directed KR model Section nodes directed Twitter Section A Track for Rumor Propagation To display the evolution of rumor propagation by the proposed model, we make a track experiment on a small synthetic data set. We set the rumormonger to be the one with medium degree in the network, the initial temperature as 1, and the rumor expression as an approximate form of classical annealing schedule. The track of rumor propagation over time steps is illustrated through the second subgraph to the last subgraph in Figure

14 Network step 1 step 2 step 3 step 4 step 5 step 6 step 15 step step 17 step 18 step 19 step 2 step 21 Figure 1: A Track for Rumor Propagation at Each Time Step The asterisks indicate spreaders and the lines indicate the propagation paths from spreaders to accepters. From these figures, we can observe the track of rumor propagation: - Initially the rumormonger spreads the rumor to two other individuals. At this time the rumor still spreads locally. - At time step 2, one of the current spreaders is the hub node of the network, who spreads the rumor to more individuals. - Due to the celebrity effect, at time step 3 more individuals become spreaders and further spread the rumor. Along this trend, large numbers of individuals are infected and the rumor breaks out at time step 5. The dense asterisks and lines mean that the rumor has become a hot topic at this time, people are glad to discuss it and exchange their opinions with each other. - There are no eternally popular rumors. From time step 6 to time step 16, people may no longer be interested in the rumor, and the number of spreaders gradually decreases. 12

15 - However, the hub node spreads the rumor again at time step 17, which leads to the rumor s reflourish. And in the subsequent steps, the rumor grows slightly and declines again. Until time step 21, the rumor eventually dies out. Normalization of Energy Time Step Spreaders Infected Individuals Energy Number of Spreaders(Infected Individuals) Figure 2: Evolution of Normalized Energy, Spreaders and Infected Individuals We also record the evolutions of three important variables, i.e., the number of current spreaders, the number of current infected individuals, and the current energy at each time step in Figure 2. The spreaders are the people who are transmitting a rumor to others and the infected individuals are the people who are accepting a rumor. From the figure, we can get some interesting observations. 1) the evolution of the energy lags behind the change of the numbers of spreaders and infected individuals. When the numbers of spreaders and infected individuals turn to decrease, the energy value still grows. When the former two died out, the latter still lasts for a long period. This is because whether a spreader transmits a rumor to others depends on his sending probability which decreases over time. If the sending probability reduces to a small value, the individual may not transmit the rumor any more. When all the individuals sending probabilities reduce to a small value, there may not be any infected individuals or spreaders in the network. However, at this time, the individuals energies still exist (E(t) = j E(t j)/j = j cmt (t j)/j has not yet reduced to ). 13

16 2) The evolution of rumor propagation goes through a process of three stages, including rapid growth, fluctuant persistence and slow decline. 3) The energy value oscillates at time step 17. Such oscillation points that authoritative individuals repetitive transmissions may lead to a rumor s reflourish. Note that, the simulation result is particular to the proposed model, since the Energy Model permits individuals spread a rumor repeatedly, which can lead to the rumor s resurgence. Moreover, rumor s decay function designed in Energy Model guarantees the energy value can ultimately converge to. These characteristics are coincident with the real-world phenomenon of rumor propagation Model Comparison Normalization of the Number of Spreaders Rumor 1 Rumor 2 Normalization of the Number of Spreaders Galam s Model Epidemic Model Energy Model Time Step (a) Trends of Two Real Rumor Propagations Time Step (b) Comparison between Energy Model and Two Traditional Models Figure 3: Comparison among Energy Model, Traditional Models and Real Rumor Propagations It has been demonstrated that the rising and falling pattern of rumor propagation does not present a simple or stable shape [27, 28]. A rumor s popularity always grows and fades in a periodic and fluctuant trend [15, 27]. In order to further confirm this conclusion, we collect two real rumors the United State formally declares war on Iran (Rumor 1) and Bai Yansong (who is a famous host) resigns his post (Rumor 2) spreading in Sina Weibo and analyze their propagation trends with the relevant data. We first subdivide the span of rumor propagation into equal time intervals and count the number of spreaders in each interval. And then we normalize the count 14

17 values through dividing them by the maximum value of all the intervals. The trends of rumor propagation for these two rumors are shown in Figure 3(a). To evaluate the performance of the proposed model, we make the simulations of three models, i.e., Energy Model, Galam s Model and Epidemic Model on a synthetic network and compare their simulation results with real rumor propagations. We first construct a synthetic directed network using KR model which is an approach to generate directed scale-free networks and is widely used to simulate web hyperlinks and social networks [26, 29]. And then we run the three models on it and observe the simulation results. To avoid the randomness, we make simulations 5 times for each model and take the average of them. We also normalize the simulation results through dividing the number of spreaders in each time step by the maximum one of the whole evolution. In this experiment, we set the proportion of initial rumormongers for Galam s Model to be.2 and set the probability that people changed from ignoramuses to spreaders for Epidemic Model to be.8 and the probability that people changed from spreaders to stiflers to be.1. These parameters are set according to the previous researches [8, 2]. For Energy Model, we set the initial temperature of the rumor to be 5 and the probability parameter p to be.7. The trends of rumor propagation for the three models are shown in Figure 3(b). The experiment results show that 1) Galam s Model only simulates the decay stage of rumor propagation and the number of spreaders monotonously diminishes in a short time. This conclusion is in line with the experimental results in Ellero s research [8]. 2) Epidemic Model describes rumor propagation going through growth and decline in two stages. The trend of rumor propagation for Epidemic Model exhibits a spiky shape. In the previous research, Moreno et al. performed extensive simulation experiments and obtained the same results [2]. 3) Energy Model depicts rumor propagation experiencing rapid growth, fluctuant persistence and slow decline in three stages. Differing from the above two models, the evolution is not stable, but periodic and fluctuant. To examine the simulation results in different parameter settings for Energy Model, we make simulations by perturbing the parameters. We first set the probability parameter p to be.7 and perturb the initial temperature of a rumor. The experiment results are shown in Figure 4(a). We then set the initial temperature to be 5 and perturb the probability parameter p. The experiment results are shown in Figure 4(b). The experiment results demonstrate that Energy Model can depict the 15

18 Normalization of the Number of Spreaders Initial Temperature = 5 Initial Temperature = 1 Initial Temperature = 2 Normalization of the Number of Spreaders Probability Parameter p =.1 Probability Parameter p =.4 Probability Parameter p =.7 Probability Parameter p = Time Step (a) Trends of Rumor Propagation in Different Initial Temperatures Time Step (b) Trends of Rumor Propagation in Different Probability Parameters Figure 4: Trends of Rumor Propagation for Energy Model in different Parameter Settings periodic and fluctuant trends of rumor propagation in different initial temperatures and probability parameters. We also find that the higher the initial temperature is or the larger the probability parameter p is, the more popularity the rumor has. This is because initial temperature and probability parameter p are respectively the indirect acting factor and the direct acting factor of sending probability. The two large parameters can make the sending probability keep large for long and lengthen the duration of rumor propagation. From the above experiments, we could conclude that Energy Model simulates rumor propagation more accurately than the other two models Dynamics of Rumor Propagation The reach of rumor spreading and the peak value of a rumor s influence are two important practical measures to reflect the dynamics of rumor propagation. In this section, we study the relationship between these two measures and their influencing factors on a large-scale data set crawled from Twitter Reach of Rumor Propagation The reach of rumor propagation measures whether a rumor reaches a high number of individuals, and is defined as the final density of stiflers r = N stiflers /N [2]. If r is large, the rumor spreading within the network is threatening; oppositely, the rumor has less impacts. In this section, we investigate how the two factors, i.e., the degree of initial spreader d init and the sending probability p, affect the measure r. 16

19 We run the experiments on Twitter data set by disturbing the two factors and observe the final density of stiflers r. The parameter p of sending probability is set from to 1 by step.1. And each user is in turn to be the initial rumormonger. In this network, the number of users followers (the degree) ranges from 1 to 93. Due to the randomness of rumor propagation, we make the simulations 5 times for each parameter setting and calculate the average value. The experimental results are shown in Figure 5(a). As expected, the number of infected individuals increases as the rumormonger s degree and probability parameter p increase. Density of Infected Individuals Degree of Initial Spreader Probability Parameter p (a) r affected by d init and p p =.7 degree = Density of Infected Individuals.2.1 Density of Infected Individuals Degree of Initial Spreader Probability Parameter p (b) Relationship between r and d init (c) Relationship between r and p Figure 5: Investigation for Reach of Rumor Propagation We also set the probability parameter p as.7 and the degree of initial 17

20 rumormonger as 9 respectively, to get two sectional drawings. The subgraph(b) in Figure 5 describes the relationship between the reach of rumor propagation r and the degree of initial rumormonger d init. When the degree is low, the rumor spreads locally. Because the rumormonger has less authority in the network and is difficult to push his message to other people. With the increasing of rumormonger s degree, the rumor spreads widely. And when the degree reaches 2, the growth begins to flatten, which means at this stage, the reach of rumor propagation doesn t obviously scale with the degree of rumormongers. This is because social networks usually have some local groups. In these groups, even the local hub individuals are set to be the initial spreaders, the rumor still remains locally and is difficult to spread among the groups. When the degree is up to 8, the reach of rumor increases rapidly. At this time, the individuals with such high degrees are usually the hubs of the whole network, and they can push their information extensively to all the groups. The subgraph(c) in Figure 5 describes the relationship between the reach of rumor propagation r and the parameter p of sending probability. When the parameter p is less than.2, the rumor can not spread. However, when the parameter p is higher than.2, the reach of rumor propagation is approximately linear growth with the increase of p. Based on the above discussion, we could conclude that the reach of rumor propagation increases with the growth of the initial rumormonger s degree and the sending probability. On the one hand, hub individuals always play important roles in information dissemination. Therefore, it is an effective strategy to prevent rumor spreading by controlling the high-degree nodes. On the other side, sending probability measures the activeness of social networks. Thus, frequent communication would facilitate the rumor propagation Peak Value of Rumor s Influence The peak value of rumor s influence is given by the maximum energy value of the network E max during the whole evolution. A large value of E max means the rumor has an explosive influence at one point. Here we consider it is relevant to the initial temperature of a rumor T and the parameter of sending probability p. In the experiment, the parameter p of sending probability is set from to 1 by step.1 and the initial temperature is set from to 1 by step 1. The experiment results in Figure 6(a) show that the peak value of a rumor s influence increases as the initial temperature and the probability parameter 18

21 x Maximum Energy Initial Temperature Probability Parameter p (a) E max affected by T and p 4 x 15 p = x 15 initial T = Maximum Energy Maximum Energy Initial Temperature Probability Parameter p (b) Relationship between E max and T (c) Relationship between E max and p Figure 6: Investigation for Peak Value of Rumor s Influence p increase. We respectively set the probability parameter p to be.7 and set the initial temperature of a rumor to be 5, to get two sectional drawings. The subgraph(b) in Figure 6 describes the relationship between E max and T. The experimental results show that the peak value is approximately linear growth with the increase of the initial temperature, because an attractive rumor would have more impacts on society. The subgraph(c) in Figure 6 describes the relationship between E max and the parameter p of sending probability. From this figure, we observe that when p is less than.2, the peak value E max is close to, since under this condition the rumor is difficult to spread. 19

22 When p is higher than.2, the peak value E max increases with the growth of the sending probability, because high sending probability facilitates people to spread the rumor more actively. And this increase has the property of diminishing marginal utility, because although there are new infected ones emerging, the previous spreaders keep losing their interests in the rumor as well. Consequently, for a given rumor, whose peak value and length are finite. 5. Conclusions In this paper, by the inspiration of the physical theory we propose a novel model called Energy Model to simulate the rumor propagation on social networks. Comparing with the other traditional models, the proposed model can discover some important characteristics of rumor propagation, i.e., 1) rumor propagation experiences three stages; 2) hub nodes and common nodes have different effects on rumor spreading; 3) individuals may spread rumor repeatedly to result in a rumor s resurgence; 4) the dynamics of rumor propagation are affected by several important influencing factors. The extensive experiments and convincing analyses show that the proposed model could depict the evolution of rumor propagation more accurately. 6. Acknowledgment This work is supported by the National Natural Science Foundation of China (No , ,69334,61353),National High-tech R&D Program of China(863 Program)(No.213AA1A66,212AA113),National Program on Key Basic Research Project (973 Program)(No.213CB32952) References [1] K. Kawachi, M. Seki, H. Yoshida, Y. Otake, K. Warashina, H. Ueda, A rumor transmission model with various contact interactions, Journal of theoretical biology 253 (1) (28) [2] D. J. Daley, D. G. Kendall, Epidemics and rumours. [3] R. M. Anderson, R. M. May, B. Anderson, Infectious diseases of humans: dynamics and control, Vol. 28, Wiley Online Library, [4] H. W. Hethcote, The mathematics of infectious diseases, SIAM review 42 (4) (2)

23 [5] L. Zhao, Q. Wang, J. Cheng, Y. Chen, J. Wang, W. Huang, Rumor spreading model with consideration of forgetting mechanism: A case of online blogging livejournal, Physica A: Statistical Mechanics and its Applications 39 (13) (211) [6] L. Zhao, J. Wang, Y. Chen, Q. Wang, J. Cheng, H. Cui, Sihr rumor spreading model in social networks, Physica A: Statistical Mechanics and its Applications 391 (7) (212) [7] S. Galam, Modelling rumors: the no plane Pentagon French hoax case, Physica A: Statistical Mechanics and Its Applications 32 (23) doi:1.116/s (2) [8] A. Ellero, G. Fasano, A. Sorato, A modified Galams model for word-ofmouth information exchange, Physica A: Statistical Mechanics and Its Applications 388 (29) doi:1.116/j.physa [9] Z.-L. Zhang, Z.-Q. Zhang, An interplay model for rumour spreading and emergency development, Physica A: Statistical Mechanics and Its Applications 388 (29) doi:1.116/j.physa [1] L.-A. Huo, P. Huang, X. Fang, An interplay model for authorities actions and rumor spreading in emergency event, Physica A: Statistical Mechanics and Its Applications 39 (211) doi:1.116/j.physa [11] L. Zhao, Q. Wang, J. Cheng, D. Zhang, T. Ma, Y. Chen, J. Wang, The impact of authorities media and rumor dissemination on the evolution of emergency, Physica A: Statistical Mechanics and its Applications 391 (15) (212) [12] D. Kempe, J. Kleinberg, É. Tardos, Maximizing the spread of influence through a social network, in: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 23, pp [13] D. Zanette, Dynamics of rumor propagation on small-world networks, Physical review E 65 (4) (22) [14] W. A. Peterson, N. P. Gist, Rumor and public opinion, American Journal of Sociology (1951)

24 [15] F. Zhang, G. Si, P. Luo, A survey of rumor propagation models, Complex systems and complexity science 6 (4) (29) [16] S. Kirkpatrick, M. P. Vecchi, C. D. Gelatt, kb, Optimization by Simulated Annealing, in: IBM Germany Scientific Symposium Series, Vol. 22, 4598, 1983, pp doi:1.1126/science [17] P. J. Van Laarhoven, E. H. Aarts, Simulated annealing, Springer, [18] E. Mossel, S. Roch, On the submodularity of influence in social networks, in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, ACM, 27, pp [19] R. Albert, A. Barabási, Statistical mechanics of complex networks, Reviews of modern physics 74. [2] Y. Moreno, M. Nekovee, A. Pacheco, Dynamics of rumor spreading in complex networks, Physical Review E 69 (6) (24) [21] C. Castellano, D. Vilone, A. Vespignani, Incomplete ordering of the voter model on small-world networks, EPL (Europhysics Letters) 63 (1) (27) 153. [22] C. Schneider-Mizell, L. Sander, A generalized voter model on complex networks, Journal of Statistical Physics 136 (1) (29) [23] D. Kempe, J. Kleinberg, É. Tardos, Influential nodes in a diffusion model for social networks, Automata, Languages and Programming (25) [24] A. Barabási, R. Albert, Emergence of scaling in random networks, science 286 (5439) (1999) [25] Y. Moreno, R. P. Satorras, A. Vespignani, Critical Load and Congestion Instabilities in Scale - Free Networks. [26] P. Krapivsky, G. Rodgers, S. Redner, Degree distributions of growing networks, Physical Review Letters 86 (23) (21) [27] J. Yang, J. Leskovec, Patterns of temporal variation in online media, in: Proceedings of the fourth ACM international conference on Web search and data mining, ACM, 211, pp

25 [28] Y. Matsubara, Y. Sakurai, B. A. Prakash, L. Li, C. Faloutsos, Rise and fall patterns of information diffusion: model and implications, in: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 212, pp [29] H. Zhang, A. van Moorsel, Fast generation of scale free networks with directed arcs, Computer Performance Engineering (29)

Diffusion of information and social contagion

Diffusion of information and social contagion Diffusion of information and social contagion Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics

More information

DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks

DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Department of Electronic Engineering, Shanghai

More information

Diffusion of Innovation and Influence Maximization

Diffusion of Innovation and Influence Maximization Diffusion of Innovation and Influence Maximization Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics

More information

Epidemics and information spreading

Epidemics and information spreading Epidemics and information spreading Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social Network

More information

CSCI 3210: Computational Game Theory. Cascading Behavior in Networks Ref: [AGT] Ch 24

CSCI 3210: Computational Game Theory. Cascading Behavior in Networks Ref: [AGT] Ch 24 CSCI 3210: Computational Game Theory Cascading Behavior in Networks Ref: [AGT] Ch 24 Mohammad T. Irfan Email: mirfan@bowdoin.edu Web: www.bowdoin.edu/~mirfan Course Website: www.bowdoin.edu/~mirfan/csci-3210.html

More information

ECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence

ECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence ECS 289 F / MAE 298, Lecture 15 May 20, 2014 Diffusion, Cascades and Influence Diffusion and cascades in networks (Nodes in one of two states) Viruses (human and computer) contact processes epidemic thresholds

More information

GlobalStabilityofStificrsImpactonMemeTransmissionModel. Global Stability of Stificrs Impact on Meme Transmission Model

GlobalStabilityofStificrsImpactonMemeTransmissionModel. Global Stability of Stificrs Impact on Meme Transmission Model Global Journal of Science Frontier Research: F Mathematics and Decision Sciences Volume 14 Issue 6 Version 1. Year 14 Type : Double Blind Peer Reviewed International Research Journal Publisher: Global

More information

Maximizing the Spread of Influence through a Social Network. David Kempe, Jon Kleinberg, Éva Tardos SIGKDD 03

Maximizing the Spread of Influence through a Social Network. David Kempe, Jon Kleinberg, Éva Tardos SIGKDD 03 Maximizing the Spread of Influence through a Social Network David Kempe, Jon Kleinberg, Éva Tardos SIGKDD 03 Influence and Social Networks Economics, sociology, political science, etc. all have studied

More information

Info-Cluster Based Regional Influence Analysis in Social Networks

Info-Cluster Based Regional Influence Analysis in Social Networks Info-Cluster Based Regional Influence Analysis in Social Networks Chao Li,2,3, Zhongying Zhao,2,3,JunLuo, and Jianping Fan Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen

More information

Characterizing Large-scale Population s Indoor Spatiotemporal Interactive Behaviors

Characterizing Large-scale Population s Indoor Spatiotemporal Interactive Behaviors Session 1 #4 ACM SIGKDD International Workshop on Urban Computing (UrbComp 2012) August 12, 2012 - Beijing, China Held in conjunction with the 18th ACM SIGKDD 2012 Characterizing Large-scale Population

More information

Web Structure Mining Nodes, Links and Influence

Web Structure Mining Nodes, Links and Influence Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.

More information

Modeling and Analyzing the Interaction between Network Rumors and Authoritative Information

Modeling and Analyzing the Interaction between Network Rumors and Authoritative Information Entropy 25, 7, 47-482; doi:.339/e747 Article OPEN ACCESS entropy ISSN 99-43 www.mdpi.com/journal/entropy Modeling and Analyzing the Interaction between Networ Rumors and Authoritative Information Lingling

More information

Modeling Social Media Memes as a Contagious Process

Modeling Social Media Memes as a Contagious Process Modeling Social Media Memes as a Contagious Process S.Towers 1,, A.Person 2, C.Castillo-Chavez 1 1 Arizona State University, Tempe, AZ, USA 2 Some University, Nowhereville, NE, USA E-mail: smtowers@asu.edu

More information

Opinion Dynamics on Triad Scale Free Network

Opinion Dynamics on Triad Scale Free Network Opinion Dynamics on Triad Scale Free Network Li Qianqian 1 Liu Yijun 1,* Tian Ruya 1,2 Ma Ning 1,2 1 Institute of Policy and Management, Chinese Academy of Sciences, Beijing 100190, China lqqcindy@gmail.com,

More information

On the Submodularity of Influence in Social Networks

On the Submodularity of Influence in Social Networks On the Submodularity of Influence in Social Networks Elchanan Mossel Dept. of Statistics U.C. Berkeley mossel@stat.berkeley.edu Sebastien Roch Dept. of Statistics U.C. Berkeley sroch@stat.berkeley.edu

More information

Reliability and Efficiency of Generalized Rumor Spreading Model on Complex Social Networks

Reliability and Efficiency of Generalized Rumor Spreading Model on Complex Social Networks Commun. Theor. Phys. 60 (2013) 139 144 Vol. 60, No. 1, July 15, 2013 Reliability and Efficiency of Generalized Rumor Spreading Model on Complex Social Networks Yaghoob Naimi 1, and Mohammad Naimi 2 1 Department

More information

Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks. Osman Yağan

Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks. Osman Yağan Modeling, Analysis, and Control of Information Propagation in Multi-layer and Multiplex Networks Osman Yağan Department of ECE Carnegie Mellon University Joint work with Y. Zhuang and V. Gligor (CMU) Alex

More information

Influence Maximization in Dynamic Social Networks

Influence Maximization in Dynamic Social Networks Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang and Xiaoming Sun Department of Computer Science and Technology, Tsinghua University Department of Computer

More information

Models of Communication Dynamics for Simulation of Information Diffusion

Models of Communication Dynamics for Simulation of Information Diffusion Models of Communication Dynamics for Simulation of Information Diffusion Konstantin Mertsalov, Malik Magdon-Ismail, Mark Goldberg Rensselaer Polytechnic Institute Department of Computer Science 11 8th

More information

A Note on Maximizing the Spread of Influence in Social Networks

A Note on Maximizing the Spread of Influence in Social Networks A Note on Maximizing the Spread of Influence in Social Networks Eyal Even-Dar 1 and Asaf Shapira 2 1 Google Research, Email: evendar@google.com 2 Microsoft Research, Email: asafico@microsoft.com Abstract.

More information

KINETICS OF SOCIAL CONTAGION. János Kertész Central European University. SNU, June

KINETICS OF SOCIAL CONTAGION. János Kertész Central European University. SNU, June KINETICS OF SOCIAL CONTAGION János Kertész Central European University SNU, June 1 2016 Theory: Zhongyuan Ruan, Gerardo Iniguez, Marton Karsai, JK: Kinetics of social contagion Phys. Rev. Lett. 115, 218702

More information

Measurement of Burst Topic in Microblog

Measurement of Burst Topic in Microblog , pp.16-20 http://dx.doi.org/10.14257/astl.2014.78.04 Measurement of Burst Topic in Microblog Guozhong Dong 1, Xin Zou 2*, Wei Wang 1, Yaxue Hu 1, Guowei Shen 1, Korawit Orkphol 1,Wu Yang 1 1 Information

More information

Toward Understanding Spatial Dependence on Epidemic Thresholds in Networks

Toward Understanding Spatial Dependence on Epidemic Thresholds in Networks Toward Understanding Spatial Dependence on Epidemic Thresholds in Networks Zesheng Chen Department of Computer Science Indiana University - Purdue University Fort Wayne, Indiana 4685 Email: chenz@ipfw.edu

More information

A coupled model for government communication and rumor spreading in emergencies

A coupled model for government communication and rumor spreading in emergencies Xu et al. Advances in Difference Equations (2016) 2016:208 DOI 10.1186/s13662-016-0932-1 R E S E A R C H Open Access A coupled model for government communication and rumor spreading in emergencies Jiuping

More information

The Spreading of Epidemics in Complex Networks

The Spreading of Epidemics in Complex Networks The Spreading of Epidemics in Complex Networks Xiangyu Song PHY 563 Term Paper, Department of Physics, UIUC May 8, 2017 Abstract The spreading of epidemics in complex networks has been extensively studied

More information

Phase Transitions of an Epidemic Spreading Model in Small-World Networks

Phase Transitions of an Epidemic Spreading Model in Small-World Networks Commun. Theor. Phys. 55 (2011) 1127 1131 Vol. 55, No. 6, June 15, 2011 Phase Transitions of an Epidemic Spreading Model in Small-World Networks HUA Da-Yin (Ù ) and GAO Ke (Ô ) Department of Physics, Ningbo

More information

Epidemics in Complex Networks and Phase Transitions

Epidemics in Complex Networks and Phase Transitions Master M2 Sciences de la Matière ENS de Lyon 2015-2016 Phase Transitions and Critical Phenomena Epidemics in Complex Networks and Phase Transitions Jordan Cambe January 13, 2016 Abstract Spreading phenomena

More information

CS224W: Analysis of Networks Jure Leskovec, Stanford University

CS224W: Analysis of Networks Jure Leskovec, Stanford University Announcements: Please fill HW Survey Weekend Office Hours starting this weekend (Hangout only) Proposal: Can use 1 late period CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu

More information

Modeling Dynamic Evolution of Online Friendship Network

Modeling Dynamic Evolution of Online Friendship Network Commun. Theor. Phys. 58 (2012) 599 603 Vol. 58, No. 4, October 15, 2012 Modeling Dynamic Evolution of Online Friendship Network WU Lian-Ren ( ) 1,2, and YAN Qiang ( Ö) 1 1 School of Economics and Management,

More information

Stability and topology of scale-free networks under attack and defense strategies

Stability and topology of scale-free networks under attack and defense strategies Stability and topology of scale-free networks under attack and defense strategies Lazaros K. Gallos, Reuven Cohen 2, Panos Argyrakis, Armin Bunde 3, and Shlomo Havlin 2 Department of Physics, University

More information

DS504/CS586: Big Data Analytics Graph Mining II

DS504/CS586: Big Data Analytics Graph Mining II Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6-8:50PM Thursday Location: AK233 Spring 2018 v Course Project I has been graded. Grading was based on v 1. Project report

More information

A new centrality measure for probabilistic diffusion in network

A new centrality measure for probabilistic diffusion in network ACSIJ Advances in Computer Science: an International Journal, Vol. 3, Issue 5, No., September 204 ISSN : 2322-557 A new centrality measure for probabilistic diffusion in network Kiyotaka Ide, Akira Namatame,

More information

Modelling of the Hand-Foot-Mouth-Disease with the Carrier Population

Modelling of the Hand-Foot-Mouth-Disease with the Carrier Population Modelling of the Hand-Foot-Mouth-Disease with the Carrier Population Ruzhang Zhao, Lijun Yang Department of Mathematical Science, Tsinghua University, China. Corresponding author. Email: lyang@math.tsinghua.edu.cn,

More information

A Class of Rumor Spreading Models with Population Dynamics

A Class of Rumor Spreading Models with Population Dynamics Commun. Theor. Phys. 70 (2018) 795 802 Vol. 70, No. 6, December 1, 2018 A Class of Rumor Spreading Models with Population Dynamics Suyalatu Dong ( 董苏雅拉图 ) and Yong-Chang Huang ( 黄永畅 ) College of Applied

More information

Learning to Predict Opinion Share in Social Networks

Learning to Predict Opinion Share in Social Networks Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence AAAI-10 Learning to Predict Opinion Share in Social Networks Masahiro Kimura Department of Electronics and Informatics Ryukoku

More information

Characterizing Information Diffusion in Online Social Networks with Linear Diffusive Model

Characterizing Information Diffusion in Online Social Networks with Linear Diffusive Model Characterizing Information Diffusion in Online Social Networks with Linear Diffusive Model Feng Wang, Haiyan Wang, Kuai Xu, Jianhong Wu, Xiaohua Jia School of Mathematical and Natural Sciences, Arizona

More information

arxiv: v1 [physics.soc-ph] 15 Dec 2009

arxiv: v1 [physics.soc-ph] 15 Dec 2009 Power laws of the in-degree and out-degree distributions of complex networks arxiv:0912.2793v1 [physics.soc-ph] 15 Dec 2009 Shinji Tanimoto Department of Mathematics, Kochi Joshi University, Kochi 780-8515,

More information

CONTAINMENT OF MISINFORMATION PROPAGATION IN ONLINE SOCIAL NETWORKS WITH GIVEN DEADLINE

CONTAINMENT OF MISINFORMATION PROPAGATION IN ONLINE SOCIAL NETWORKS WITH GIVEN DEADLINE Association for Information Systems AIS Electronic Library (AISeL) PACIS 2014 Proceedings Pacific Asia Conference on Information Systems (PACIS) 2014 CONTAINMENT OF MISINFORMATION PROPAGATION IN ONLINE

More information

DS504/CS586: Big Data Analytics Graph Mining II

DS504/CS586: Big Data Analytics Graph Mining II Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6:00pm 8:50pm Mon. and Wed. Location: SL105 Spring 2016 Reading assignments We will increase the bar a little bit Please

More information

Supplementary Information Activity driven modeling of time varying networks

Supplementary Information Activity driven modeling of time varying networks Supplementary Information Activity driven modeling of time varying networks. Perra, B. Gonçalves, R. Pastor-Satorras, A. Vespignani May 11, 2012 Contents 1 The Model 1 1.1 Integrated network......................................

More information

Unfolding the Skorohod reflection of a semimartingale

Unfolding the Skorohod reflection of a semimartingale Unfolding the Skorohod reflection of a semimartingale Vilmos Prokaj To cite this version: Vilmos Prokaj. Unfolding the Skorohod reflection of a semimartingale. Statistics and Probability Letters, Elsevier,

More information

Diffusion of Innovation

Diffusion of Innovation Diffusion of Innovation Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social Network Analysis

More information

Lecture 10. Under Attack!

Lecture 10. Under Attack! Lecture 10 Under Attack! Science of Complex Systems Tuesday Wednesday Thursday 11.15 am 12.15 pm 11.15 am 12.15 pm Feb. 26 Feb. 27 Feb. 28 Mar.4 Mar.5 Mar.6 Mar.11 Mar.12 Mar.13 Mar.18 Mar.19 Mar.20 Mar.25

More information

Lecture 11 October 11, Information Dissemination through Social Networks

Lecture 11 October 11, Information Dissemination through Social Networks CS 284r: Incentives and Information in Networks Fall 2013 Prof. Yaron Singer Lecture 11 October 11, 2013 Scribe: Michael Tingley, K. Nathaniel Tucker 1 Overview In today s lecture we will start the second

More information

GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE

GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE Abstract SHI Lihong 1 LI Haiyong 1,2 LIU Jiping 1 LI Bin 1 1 Chinese Academy Surveying and Mapping, Beijing, China, 100039 2 Liaoning

More information

Analysis of an Optimal Measurement Index Based on the Complex Network

Analysis of an Optimal Measurement Index Based on the Complex Network BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 5 Special Issue on Application of Advanced Computing and Simulation in Information Systems Sofia 2016 Print ISSN: 1311-9702;

More information

Epidemic spreading on heterogeneous networks with identical infectivity

Epidemic spreading on heterogeneous networks with identical infectivity Physics Letters A 364 (2007) 189 193 wwwelseviercom/locate/pla Epidemic spreading on heterogeneous networs with identical infectivity Rui Yang, Bing-Hong Wang, Jie Ren, Wen-Jie Bai, Zhi-Wen Shi, Wen-Xu

More information

A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free

A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free Commun. Theor. Phys. (Beijing, China) 46 (2006) pp. 1011 1016 c International Academic Publishers Vol. 46, No. 6, December 15, 2006 A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free

More information

Hierarchical Structures on Multigranulation Spaces

Hierarchical Structures on Multigranulation Spaces Yang XB, Qian YH, Yang JY. Hierarchical structures on multigranulation spaces. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(6): 1169 1183 Nov. 2012. DOI 10.1007/s11390-012-1294-0 Hierarchical Structures

More information

Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity

Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity Networks as vectors of their motif frequencies and 2-norm distance as a measure of similarity CS322 Project Writeup Semih Salihoglu Stanford University 353 Serra Street Stanford, CA semih@stanford.edu

More information

Research Article Snowdrift Game on Topologically Alterable Complex Networks

Research Article Snowdrift Game on Topologically Alterable Complex Networks Mathematical Problems in Engineering Volume 25, Article ID 3627, 5 pages http://dx.doi.org/.55/25/3627 Research Article Snowdrift Game on Topologically Alterable Complex Networks Zhe Wang, Hong Yao, 2

More information

Detecting Anti-majority Opinionists Using Value-weighted Mixture Voter Model

Detecting Anti-majority Opinionists Using Value-weighted Mixture Voter Model Detecting Anti-majority Opinionists Using Value-weighted Mixture Voter Model Masahiro Kimura, Kazumi Saito 2, Kouzou Ohara 3, and Hiroshi Motoda 4 Department of Electronics and Informatics, Ryukoku University

More information

Kristina Lerman USC Information Sciences Institute

Kristina Lerman USC Information Sciences Institute Rethinking Network Structure Kristina Lerman USC Information Sciences Institute Università della Svizzera Italiana, December 16, 2011 Measuring network structure Central nodes Community structure Strength

More information

arxiv: v1 [physics.soc-ph] 9 Jul 2008

arxiv: v1 [physics.soc-ph] 9 Jul 2008 Theory of rumour spreading in complex social networks arxiv:87.1458v1 [physics.soc-ph] 9 Jul 28 M. Nekovee a, Y. Moreno b, G. Bianconi c and M. Marsili c a BT Research, Polaris 134, Adastral Park, Martlesham,

More information

Die-out Probability in SIS Epidemic Processes on Networks

Die-out Probability in SIS Epidemic Processes on Networks Die-out Probability in SIS Epidemic Processes on etworks Qiang Liu and Piet Van Mieghem Abstract An accurate approximate formula of the die-out probability in a SIS epidemic process on a network is proposed.

More information

arxiv: v4 [cs.si] 21 May 2017

arxiv: v4 [cs.si] 21 May 2017 Submitted to manuscript 2017 No Time to Observe: Adaptive Influence Maximization with Partial Feedback Jing Yuan Shaojie Tang The University of Texas at Dallas arxiv:1609.00427v4 [cs.si] 21 May 2017 Although

More information

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,b,, Bi Li b,a,c, Nicolas Nisse b,a, Hervé Rivano d, Min-Li Yu e a Univ. Nice Sophia Antipolis, CNRS,

More information

Project 1 Modeling of Epidemics

Project 1 Modeling of Epidemics 532 Chapter 7 Nonlinear Differential Equations and tability ection 7.5 Nonlinear systems, unlike linear systems, sometimes have periodic solutions, or limit cycles, that attract other nearby solutions.

More information

Computing Competing Cascades on Signed Networks

Computing Competing Cascades on Signed Networks Noname manuscript No. (will be inserted by the editor Computing Competing Cascades on Signed Networks Ajitesh Srivastava Charalampos Chelmis Viktor K. Prasanna Received: date / Accepted: date Abstract

More information

KINETICS OF COMPLEX SOCIAL CONTAGION. János Kertész Central European University. Pohang, May 27, 2016

KINETICS OF COMPLEX SOCIAL CONTAGION. János Kertész Central European University. Pohang, May 27, 2016 KINETICS OF COMPLEX SOCIAL CONTAGION János Kertész Central European University Pohang, May 27, 2016 Theory: Zhongyuan Ruan, Gerardo Iniguez, Marton Karsai, JK: Kinetics of social contagion Phys. Rev. Lett.

More information

Probability Models of Information Exchange on Networks Lecture 6

Probability Models of Information Exchange on Networks Lecture 6 Probability Models of Information Exchange on Networks Lecture 6 UC Berkeley Many Other Models There are many models of information exchange on networks. Q: Which model to chose? My answer good features

More information

Beating Social Pulse: Understanding Information Propagation via Online Social Tagging Systems 1

Beating Social Pulse: Understanding Information Propagation via Online Social Tagging Systems 1 Journal of Universal Computer Science, vol. 18, no. 8 (2012, 1022-1031 submitted: 16/9/11, accepted: 14/12/11, appeared: 28/4/12 J.UCS Beating Social Pulse: Understanding Information Propagation via Online

More information

Open Access Permanent Magnet Synchronous Motor Vector Control Based on Weighted Integral Gain of Sliding Mode Variable Structure

Open Access Permanent Magnet Synchronous Motor Vector Control Based on Weighted Integral Gain of Sliding Mode Variable Structure Send Orders for Reprints to reprints@benthamscienceae The Open Automation and Control Systems Journal, 5, 7, 33-33 33 Open Access Permanent Magnet Synchronous Motor Vector Control Based on Weighted Integral

More information

CALCULATION OF THE MINIMUM COMPUTATIONAL COMPLEXITY BASED ON INFORMATION ENTROPY

CALCULATION OF THE MINIMUM COMPUTATIONAL COMPLEXITY BASED ON INFORMATION ENTROPY CALCULATION OF THE MINIMUM COMPUTATIONAL COMPLEXITY BASED ON INFORMATION ENTROPY Xue Wu 1 1 Department of Microelectronics, Tsinghua University, Beijing, China wuxiqh@yahoo.cn ABSTRACT In order to find

More information

CS 322: (Social and Information) Network Analysis Jure Leskovec Stanford University

CS 322: (Social and Information) Network Analysis Jure Leskovec Stanford University CS 322: (Social and Inormation) Network Analysis Jure Leskovec Stanord University Initially some nodes S are active Each edge (a,b) has probability (weight) p ab b 0.4 0.4 0.2 a 0.4 0.2 0.4 g 0.2 Node

More information

A Framework of Detecting Burst Events from Micro-blogging Streams

A Framework of Detecting Burst Events from Micro-blogging Streams , pp.379-384 http://dx.doi.org/10.14257/astl.2013.29.78 A Framework of Detecting Burst Events from Micro-blogging Streams Kaifang Yang, Yongbo Yu, Lizhou Zheng, Peiquan Jin School of Computer Science and

More information

Optimal contact process on complex networks

Optimal contact process on complex networks Optimal contact process on complex networks Rui Yang, 1 Tao Zhou, 2,3 Yan-Bo Xie, 2 Ying-Cheng Lai, 1,4 and Bing-Hong Wang 2 1 Department of Electrical Engineering, Arizona State University, Tempe, Arizona

More information

Damon Centola.

Damon Centola. http://www.imedea.uib.es/physdept Konstantin Klemm Victor M. Eguíluz Raúl Toral Maxi San Miguel Damon Centola Nonequilibrium transitions in complex networks: a model of social interaction, Phys. Rev. E

More information

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia

More information

Source Locating of Spreading Dynamics in Temporal Networks

Source Locating of Spreading Dynamics in Temporal Networks Source Locating of Spreading Dynamics in Temporal Networks Qiangjuan Huang School of Science National University of Defense Technology Changsha, Hunan, China qiangjuanhuang@foxmail.com «Supervised by Professor

More information

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 20 Apr 2004

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 20 Apr 2004 Dynamics of Rumor Spreading in Complex Networks arxiv:cond-mat/0312131v2 [cond-mat.stat-mech] 20 Apr 2004 Yamir Moreno, 1,2 Maziar Nekovee, 3 and Amalio F. Pacheco 1,2 1 Departamento de Física Teórica,

More information

A Novel Situation Awareness Model for Network Systems Security

A Novel Situation Awareness Model for Network Systems Security A Novel Situation Awareness Model for Network Systems Security Guosheng Zhao 1,2, Huiqiang Wang 1, Jian Wang 1, and Linshan Shen 1 1 Institute of Computer Science and echnology, Harbin Engineer University,

More information

Research on the defect types judgment in wind turbine blades using ultrasonic NDT

Research on the defect types judgment in wind turbine blades using ultrasonic NDT IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Research on the defect types judgment in wind turbine blades using ultrasonic NDT To cite this article: Suwei Li et al 05 IOP

More information

A note on modeling retweet cascades on Twitter

A note on modeling retweet cascades on Twitter A note on modeling retweet cascades on Twitter Ashish Goel 1, Kamesh Munagala 2, Aneesh Sharma 3, and Hongyang Zhang 4 1 Department of Management Science and Engineering, Stanford University, ashishg@stanford.edu

More information

Influence Maximization in Social Networks: An Ising-model-based Approach

Influence Maximization in Social Networks: An Ising-model-based Approach Influence Maximization in Social etworks: An Ising-model-based Approach Shihuan Liu, Lei Ying, and Srinivas Shakkottai Department of Electrical and Computer Engineering, Iowa State University Email: {liush08,

More information

Modeling of Growing Networks with Directional Attachment and Communities

Modeling of Growing Networks with Directional Attachment and Communities Modeling of Growing Networks with Directional Attachment and Communities Masahiro KIMURA, Kazumi SAITO, Naonori UEDA NTT Communication Science Laboratories 2-4 Hikaridai, Seika-cho, Kyoto 619-0237, Japan

More information

Greedy Maximization Framework for Graph-based Influence Functions

Greedy Maximization Framework for Graph-based Influence Functions Greedy Maximization Framework for Graph-based Influence Functions Edith Cohen Google Research Tel Aviv University HotWeb '16 1 Large Graphs Model relations/interactions (edges) between entities (nodes)

More information

A New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor

A New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor A New Approach for Item Ranking Based on Review Scores Reflecting Temporal Trust Factor Kazumi Saito 1, Masahiro Kimura 2, Kouzou Ohara 3, and Hiroshi Motoda 4,5 1 School of Administration and Informatics,

More information

On Susceptible-Infected-Susceptible Epidemic Spreading: an Overview of Recent Study

On Susceptible-Infected-Susceptible Epidemic Spreading: an Overview of Recent Study The 1 st Net-X (2017) On Susceptible-Infected-Susceptible Epidemic Spreading: an Overview of Recent Study Cong Li Adaptive Networks and Control Lab, Fudan University Collaborators: Xiaojie Li, Jianbo Wang,

More information

Oriented majority-vote model in social dynamics

Oriented majority-vote model in social dynamics Author: Facultat de Física, Universitat de Barcelona, Diagonal 645, 08028 Barcelona, Spain. Advisor: M. Ángeles Serrano Mass events ruled by collective behaviour are present in our society every day. Some

More information

Network Science (overview, part 1)

Network Science (overview, part 1) Network Science (overview, part 1) Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California rgera@nps.edu Excellence Through Knowledge Overview Current research Section 1:

More information

Nonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network Added with Nonlinear Preference

Nonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network Added with Nonlinear Preference Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 137 142 c International Academic Publishers Vol. 48, No. 1, July 15, 2007 Nonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network

More information

New Feedback Control Model in the Lattice Hydrodynamic Model Considering the Historic Optimal Velocity Difference Effect

New Feedback Control Model in the Lattice Hydrodynamic Model Considering the Historic Optimal Velocity Difference Effect Commun. Theor. Phys. 70 (2018) 803 807 Vol. 70, No. 6, December 1, 2018 New Feedback Control Model in the Lattice Hydrodynamic Model Considering the Historic Optimal Velocity Difference Effect Guang-Han

More information

Information Propagation Analysis of Social Network Using the Universality of Random Matrix

Information Propagation Analysis of Social Network Using the Universality of Random Matrix Information Propagation Analysis of Social Network Using the Universality of Random Matrix Yusuke Sakumoto, Tsukasa Kameyama, Chisa Takano and Masaki Aida Tokyo Metropolitan University, 6-6 Asahigaoka,

More information

Why does attention to web articles fall with time?

Why does attention to web articles fall with time? Why does attention to web articles fall with time? M.V. Simkin and V.P. Roychowdhury Department of Electrical Engineering, University of California, Los Angeles, CA 90095-594 We analyze access statistics

More information

This is a repository copy of Aggregation of growing crystals in suspension: III. Accounting for adhesion and repulsion.

This is a repository copy of Aggregation of growing crystals in suspension: III. Accounting for adhesion and repulsion. This is a repository copy of Aggregation of growing crystals in suspension: III. Accounting for adhesion and repulsion. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/88281/

More information

Cascading Behavior in Networks: Algorithmic and Economic Issues

Cascading Behavior in Networks: Algorithmic and Economic Issues CHAPTER 24 Cascading Behavior in Networks: Algorithmic and Economic Issues Jon Kleinberg Abstract The flow of information or influence through a large social network can be thought of as unfolding with

More information

Analytically tractable processes on networks

Analytically tractable processes on networks University of California San Diego CERTH, 25 May 2011 Outline Motivation 1 Motivation Networks Random walk and Consensus Epidemic models Spreading processes on networks 2 Networks Motivation Networks Random

More information

NONLINEAR FEEDBACK LOOPS. Posted on February 5, 2016 by Joss Colchester

NONLINEAR FEEDBACK LOOPS. Posted on February 5, 2016 by Joss Colchester NONLINEAR FEEDBACK LOOPS Posted on February 5, 2016 by Joss Colchester NONLINEAR FEEDBACK LOOPS A feedback loop could be defined as a channel or pathway formed by an 'effect' returning to its 'cause,'

More information

Exploring spatial decay effect in mass media and social media: a case study of China

Exploring spatial decay effect in mass media and social media: a case study of China Exploring spatial decay effect in mass media and social media: a case study of China 1. Introduction Yihong Yuan Department of Geography, Texas State University, San Marcos, TX, USA, 78666. Tel: +1(512)-245-3208

More information

Influence Maximization in Continuous Time Diffusion Networks

Influence Maximization in Continuous Time Diffusion Networks Manuel Gomez-Rodriguez 1,2 Bernhard Schölkopf 1 1 MPI for Intelligent Systems and 2 Stanford University MANUELGR@STANFORD.EDU BS@TUEBINGEN.MPG.DE Abstract The problem of finding the optimal set of source

More information

RaRE: Social Rank Regulated Large-scale Network Embedding

RaRE: Social Rank Regulated Large-scale Network Embedding RaRE: Social Rank Regulated Large-scale Network Embedding Authors: Yupeng Gu 1, Yizhou Sun 1, Yanen Li 2, Yang Yang 3 04/26/2018 The Web Conference, 2018 1 University of California, Los Angeles 2 Snapchat

More information

Growing a Network on a Given Substrate

Growing a Network on a Given Substrate Growing a Network on a Given Substrate 1 Babak Fotouhi and Michael G. Rabbat Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada Email: babak.fotouhi@mail.mcgill.ca,

More information

THE APPLICATION OF GREY SYSTEM THEORY TO EXCHANGE RATE PREDICTION IN THE POST-CRISIS ERA

THE APPLICATION OF GREY SYSTEM THEORY TO EXCHANGE RATE PREDICTION IN THE POST-CRISIS ERA International Journal of Innovative Management, Information & Production ISME Internationalc20 ISSN 285-5439 Volume 2, Number 2, December 20 PP. 83-89 THE APPLICATION OF GREY SYSTEM THEORY TO EXCHANGE

More information

Thank you for your interest in the Support Resistance Strength Analyzer!

Thank you for your interest in the Support Resistance Strength Analyzer! This user manual refer to FXCM s Trading Station version of the indicator Support Resistance Strength Analyzer Thank you for your interest in the Support Resistance Strength Analyzer! This unique indicator

More information

arxiv: v2 [physics.soc-ph] 5 Sep 2016

arxiv: v2 [physics.soc-ph] 5 Sep 2016 Unifying Markov Chain Approach for Disease and Rumor Spreading in Complex Networks Guilherme Ferraz de Arruda, 1 Francisco A. Rodrigues, 1, Pablo Martín Rodríguez, 1 Emanuele Cozzo, 2, 3 2, 3, 4, and Yamir

More information

Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization

Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization Ji Li Zhipeng Cai Department of Computer Science Georgia State University Atlanta, Georgia 33 Email: jli3@student.gsu.edu

More information

Average Receiving Time for Weighted-Dependent Walks on Weighted Koch Networks

Average Receiving Time for Weighted-Dependent Walks on Weighted Koch Networks ISSN 1749-3889 (print), 1749-3897 (online) International Journal of Nonlinear Science Vol.17(2014) No.3,pp.215-220 Average Receiving Time for Weighted-Dependent Walks on Weighted Koch Networks Lixin Tang

More information

The Dynamic Properties of a Deterministic SIR Epidemic Model in Discrete-Time

The Dynamic Properties of a Deterministic SIR Epidemic Model in Discrete-Time Applied Mathematics, 05, 6, 665-675 Published Online September 05 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/046/am056048 The Dynamic Properties of a Deterministic SIR Epidemic Model in Discrete-Time

More information

ECS 253 / MAE 253, Lecture 15 May 17, I. Probability generating function recap

ECS 253 / MAE 253, Lecture 15 May 17, I. Probability generating function recap ECS 253 / MAE 253, Lecture 15 May 17, 2016 I. Probability generating function recap Part I. Ensemble approaches A. Master equations (Random graph evolution, cluster aggregation) B. Network configuration

More information