In this paper,an improved Susceptible-Infected-Susceptible(SIS) epidemic spreading model is proposed in order to provide a theoretical method to analyze and predict the spreading of diseases.This model is based on the...In this paper,an improved Susceptible-Infected-Susceptible(SIS) epidemic spreading model is proposed in order to provide a theoretical method to analyze and predict the spreading of diseases.This model is based on the following ideas:in social networks,the contact probability between nodes is decided by their social distances and their active degrees.The contact probability of two indirectly connected nodes is decided by the shortest path between them.Theoretical analysis and simulation experiment were conducted to evaluate the performance of this improved model.Because the proposed model is independent of the network structure,simulation experiments were done in several kinds of networks,namely the ER network,the random regular network,the WS small world network,and the BA scale-free network,in order to study the influences of certain factors have on the epidemic spreading,such as the social contact active degree,the network structure,the average degree,etc.This improved model provides an idea for studying the spreading rule of computer virus,attitudes,fashion styles and public opinions in social networks.展开更多
Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analys...Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.展开更多
基金supported by National Natural Science Foundation of China 61301091Shaanxi Province Science and Technology Project 2015GY015
文摘In this paper,an improved Susceptible-Infected-Susceptible(SIS) epidemic spreading model is proposed in order to provide a theoretical method to analyze and predict the spreading of diseases.This model is based on the following ideas:in social networks,the contact probability between nodes is decided by their social distances and their active degrees.The contact probability of two indirectly connected nodes is decided by the shortest path between them.Theoretical analysis and simulation experiment were conducted to evaluate the performance of this improved model.Because the proposed model is independent of the network structure,simulation experiments were done in several kinds of networks,namely the ER network,the random regular network,the WS small world network,and the BA scale-free network,in order to study the influences of certain factors have on the epidemic spreading,such as the social contact active degree,the network structure,the average degree,etc.This improved model provides an idea for studying the spreading rule of computer virus,attitudes,fashion styles and public opinions in social networks.
基金supported in part by the US National Science Foundation
文摘Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.
