Online social network is increasingly showing a significant impact and role in many areas of social life. In the study of online social network related issues have become the consensus of the academic and industrial c...Online social network is increasingly showing a significant impact and role in many areas of social life. In the study of online social network related issues have become the consensus of the academic and industrial communities and the urgent need for. This paper mainly studies the problem of information dissemination in social network, the mode of communication, behavior, propagation paths and propagation characteristics are studied, and take the Tencent micro-blog as an example, based on the analysis of many examples, several main models and characteristics of information dissemination in social network platform.展开更多
Along with the rapid development of social networks, social network worms have constituted one of the major internet security problems. The root of worm is the inevitable software vulnerability during the design and i...Along with the rapid development of social networks, social network worms have constituted one of the major internet security problems. The root of worm is the inevitable software vulnerability during the design and implementation process of software. So it is hard to completely avoid worms in the existing software engineering systems. Due to lots of bandwidth consumption, the patch cannot be transmitted simultaneously by the network administrator to all hosts. This paper studies how to prevent the propagation of social network worms through the immunization of key nodes. Unlike existing containment models for worm propagation, a novel immunization strategy is proposed based on network vertex influence. The strategy selects the critical vertices in the whole network. Then the immunization is applied on the selected vertices to achieve the maximal effect of worm containment with minimal cost. Different algorithms are implemented to select vertices. Simulation experiments are presented to analyze and evaluate the performance of different algorithms.展开更多
Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to de...Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to describe the online social network with varying total number of users and user deactivation rate. We calculate the exact equilibrium points and reproduction number for this model. Furthermore, we perform the rumor spreading process in the online social network with increasing population size based on the original real world Facebook network. The simulation results indicate that the SEIR model of rumor spreading in online social network with changing total number of users can accurately reveal the inherent characteristics of rumor spreading process in online social network.展开更多
We introduce the generalized rumor spreading model and investigate some properties of this model on different complex social networks. Despite pervious rumor models that both the spreader-spreader (SS) and the spreade...We introduce the generalized rumor spreading model and investigate some properties of this model on different complex social networks. Despite pervious rumor models that both the spreader-spreader (SS) and the spreader-stifler (SR) interactions have the same rate α, we define α(1) and α(2) for SS and SR interactions, respectively. The effect of variation of α(1) and α(2) on the final density of stiflers is investigated. Furthermore, the influence of the topological structure of the network in rumor spreading is studied by analyzing the behavior of several global parameters such as reliability and efficiency. Our results show that while networks with homogeneous connectivity patterns reach a higher reliability, scale-free topologies need a less time to reach a steady state with respect the rumor.展开更多
In this paper, to study rumor spreading, we propose a novel susceptible-infected-removed （SIR） model by introducing the trust mechanism. We derive mean-field equations that describe the dynamics of the SIR model on ...In this paper, to study rumor spreading, we propose a novel susceptible-infected-removed （SIR） model by introducing the trust mechanism. We derive mean-field equations that describe the dynamics of the SIR model on homogeneous networks and inhomogeneous networks. Then a steady-state analysis is conducted to investigate the critical threshold and the finaJ size of the rumor spreading. We show that the introduction of trust mechanism reduces the final rumor size and the velocity of rumor spreading, but increases the critical thresholds on both networks. Moreover, the trust mechanism not only greatly reduces the maximum rumor influence, but also postpones the rumor terminal time, which provides us with more time to take measures to control the rumor spreading. The theoretical results are confirmed by sufficient numerical simulations.展开更多
文摘Online social network is increasingly showing a significant impact and role in many areas of social life. In the study of online social network related issues have become the consensus of the academic and industrial communities and the urgent need for. This paper mainly studies the problem of information dissemination in social network, the mode of communication, behavior, propagation paths and propagation characteristics are studied, and take the Tencent micro-blog as an example, based on the analysis of many examples, several main models and characteristics of information dissemination in social network platform.
基金supported by Fundamental Research Funds of the Central Universities under Grant no. N120317001 and N100704001Program for New Century Excellent Talents in University (NCET13-0113)+1 种基金Natural Science Foundation of Liaoning Province of China under Grant no. 201202059Program for Liaoning Excellent Talents in University under LR2013011
文摘Along with the rapid development of social networks, social network worms have constituted one of the major internet security problems. The root of worm is the inevitable software vulnerability during the design and implementation process of software. So it is hard to completely avoid worms in the existing software engineering systems. Due to lots of bandwidth consumption, the patch cannot be transmitted simultaneously by the network administrator to all hosts. This paper studies how to prevent the propagation of social network worms through the immunization of key nodes. Unlike existing containment models for worm propagation, a novel immunization strategy is proposed based on network vertex influence. The strategy selects the critical vertices in the whole network. Then the immunization is applied on the selected vertices to achieve the maximal effect of worm containment with minimal cost. Different algorithms are implemented to select vertices. Simulation experiments are presented to analyze and evaluate the performance of different algorithms.
基金Supported by National Natural Science Foundation of China under Grant Nos.11275017 and 11173028
文摘Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to describe the online social network with varying total number of users and user deactivation rate. We calculate the exact equilibrium points and reproduction number for this model. Furthermore, we perform the rumor spreading process in the online social network with increasing population size based on the original real world Facebook network. The simulation results indicate that the SEIR model of rumor spreading in online social network with changing total number of users can accurately reveal the inherent characteristics of rumor spreading process in online social network.
文摘We introduce the generalized rumor spreading model and investigate some properties of this model on different complex social networks. Despite pervious rumor models that both the spreader-spreader (SS) and the spreader-stifler (SR) interactions have the same rate α, we define α(1) and α(2) for SS and SR interactions, respectively. The effect of variation of α(1) and α(2) on the final density of stiflers is investigated. Furthermore, the influence of the topological structure of the network in rumor spreading is studied by analyzing the behavior of several global parameters such as reliability and efficiency. Our results show that while networks with homogeneous connectivity patterns reach a higher reliability, scale-free topologies need a less time to reach a steady state with respect the rumor.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61103231,61103230the Innovation Program of Graduate Scientific Research in Institution of Higher Education of Jiangsu Province of China under Grant No.CXZZ110401+1 种基金the Basic Research Foundation of Engineering University of the Chinese People's Armed Police Force under Grant No.WJY201218 the Natural Science Basic Research Plan in Shaanxi Province of China under Grant No.2011JM8012
文摘In this paper, to study rumor spreading, we propose a novel susceptible-infected-removed （SIR） model by introducing the trust mechanism. We derive mean-field equations that describe the dynamics of the SIR model on homogeneous networks and inhomogeneous networks. Then a steady-state analysis is conducted to investigate the critical threshold and the finaJ size of the rumor spreading. We show that the introduction of trust mechanism reduces the final rumor size and the velocity of rumor spreading, but increases the critical thresholds on both networks. Moreover, the trust mechanism not only greatly reduces the maximum rumor influence, but also postpones the rumor terminal time, which provides us with more time to take measures to control the rumor spreading. The theoretical results are confirmed by sufficient numerical simulations.
