Most information spreading models consider that all individuals are identical psychologically. They ignore, for instance, the curiosity level of people, which may indicate that they can be influenced to seek for information given their interest. For example, the game Pokemon GO spread rapidly because of the aroused curiosity among users. This paper proposes an information propagation model considering the curiosity level of each individual, which is a dynamical parameter that evolves over time. We evaluate the efficiency of our model in contrast to traditional information propagation models, like SIR or IC, and perform analysis on different types of artificial and real-world networks, like Google+, Facebook, and the United States roads map. We present a mean-field approach that reproduces with a good accuracy the evolution of macroscopic quantities, such as the density of stiflers, for the system's behavior with the curiosity. We also obtain an analytical solution of the mean-field equations that allows to predicts a transition from a phase where the information remains confined to a small number of users to a phase where it spreads over a large fraction of the population. The results indicate that the curiosity increases the information spreading in all networks as compared with the spreading without curiosity, and that this increase is larger in spatial networks than in social networks. When the curiosity is taken into account, the maximum number of informed individuals is reached close to the transition point. Since curious people are more open to a new product, concepts, and ideas, this is an important factor to be considered in propagation modeling. Our results contribute to the understanding of the interplay between diffusion process and dynamical heterogeneous transmission in social networks.
Several models have been proposed for modeling propagation dynamics on networks @cite_11 @cite_6 @cite_24 @cite_17 @cite_0 @cite_27 @cite_21 @cite_5 @cite_10 . These models consider some assumptions about the propagation process and network structure, like the degree correlation or distribution, classes of vertices, among others @cite_11 @cite_13 @cite_24 @cite_17 . The majority of the spreading models consider only homogeneous or fixed transmission probabilities, i.e., each vertex has the same likelihood of transmitting the information @cite_24 @cite_13 @cite_17 . For instance, in @cite_0 the authors propose a discrete-time model for rumor propagation with heterogeneous transmission probabilities, but still, each vertex has a constant probability over time. Other transmission models consider characteristics like short-term of immunity or steady active state @cite_16 , and spreaders' procrastination in the transmission of information by heterogeneous delays @cite_27 . Also, there are some proposals that introduced disbelieving or forgetting mechanism @cite_21 , lost of interest @cite_5 , apathy and many others @cite_13 . Regarding the contagion dynamic, the diffusion process can be spontaneous or by different kind of contact interaction or adaptation among the subjects @cite_10 .
@cite_13 @cite_11 @cite_21 @cite_6 @cite_24 @cite_0 @cite_27 @cite_5 @cite_16 @cite_10 @cite_17
1878853999 2054476043 2076367080 2402962589 2529088107 2552421666 1977878271 2407477614
In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The theoretical analysis of epidemic spreading in heterogeneous networks requires the development of novel analytical frameworks, and it has produced results of conceptual and practical relevance. A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear. Physicists, mathematicians, epidemiologists, computer, and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation. For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks is reported. Online social networks play a major role in the spread of information at very large scale. A lot of effort have been made in order to understand this phenomenon, ranging from popular topic detection to information diffusion modeling, including influential spreaders identification. In this article, we present a survey of representative methods dealing with these issues and propose a taxonomy that summarizes the state-of-the-art. The objective is to provide a comprehensive analysis and guide of existing efforts around information diffusion in social networks. This survey is intended to help researchers in quickly understanding existing works and possible improvements to bring. Rumor is an important form of social interaction, and its spreading has a significant impact on people’s lives. In the age of Web, people are using electronic media more frequently than ever before, and blog has become one of the main online social interactions. Therefore, it is essential to learn the evolution mechanism of rumor spreading on homogeneous network in consideration of the forgetting mechanism of spreaders. Here we study a rumor spreading model on an online social blogging platform called LiveJournal. In comparison with the Susceptible–Infected–Removed (SIR) model, we provide a more detailed and realistic description of rumor spreading process with combination of forgetting mechanism and the SIR model of epidemics. A mathematical model has been presented and numerical solutions of the model were used to analyze the impact factors of rumor spreading, such as the average degree, forgetting rate and stifling rate. Our results show that there exist a threshold of the average degree of LiveJournal and above which the influence of rumor reaches saturation. Forgetting mechanism and stifling rate exert great influence on rumor spreading on online social network. The analysis results can guide people’s behaviors in view of the theoretical and practical aspects. Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation, we assume that central individuals have a higher capacity to convince their neighbors than peripheral subjects. From extensive numerical simulations we find that spreading is improved in scale-free networks when the transmission probability is proportional to the PageRank, degree, and betweenness centrality. In addition, the results suggest that spreading can be controlled by adjusting the transmission probabilities of the most central nodes. Our results provide a conceptual framework for understanding the interplay between rumor propagation and heterogeneous transmission in social networks. While online social networks provide access to a massive information source, they also enable wide dissemination of false or inaccurate content. Undesirable results caused by misinformation propagation make its timely detection very imperative. An important question is how many monitors are required to detect all misinformation cascades at their early stage. To answer this question, we define a Time Constrained Misinformation Detection (TCMD) problem. As we have proved, there is no polynomial time (1 - e) ln n-approximation for the TCMD problem. The large number of independent misinformation cascades and heterogeneous delays make misinformation detection more challenging. Our approach includes stochastic programming and an O(ln(1 + n)) approximation algorithm for one-hop detection. This approach can provide a lower bound on the number of required monitors for general detection. Furthermore, we propose a network-compression based solution, whose effectiveness is validated by extensive experimental results. We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet. The emergence of social media increases the need for the recognization of social influence mainly motivated by online advertising, political and health campaigns, recommendation systems, epidemiological study, etc. In spreading processes, it is possible to define the most central or influential vertices according to the network topology and dynamic. On the other hand, the least influential spreaders have been disregarded. This paper aims to maximize the mean of information propagation on the network by recognizing the non influential individuals by making them better spreader. Experimental results confirm that selecting 0:5 of least influential spreaders in three social networks (google+, hamsterster and advogato) and rewiring one connection to some important vertex, increase the propagation over the entire network.