Search

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network. [ABSTRACT FROM AUTHOR]

The propagation of memes on online social networks often depends on the mechanism of social affirmation. Centola termed such social-affirmation-driven diffusion as complex contagion and partly validated it through an online experiment. However, for actual online meme propagation, the mechanism of social affirmation often takes effect in combination with various other factors and mechanisms. In this paper, we examine the combinatorial effects of social affirmation and the attractiveness and persistence of the meme by proposing and analyzing a UACI model, where an agent's activities to receive and transfer a meme is associated with the transition between its four possible states of 'Uninformed', 'Attended','Convinced' and 'Immune'. The numerical simulations illustrate nontrivial patterns of propagation. Especially, it is revealed that the effects of simple and complex contagions co-exist and equilibrate in accordance with the joint functions of meme attractiveness and social affirmation. Furthermore, the low-persistence of the meme hinders the propagation-scale more remarkably on the regular network than on the random one, indicating that the persistence may be critical for retaining complex contagion. [ABSTRACT FROM AUTHOR]

Online social networks have attracted remarkable attention since they provide various approaches for hundreds of millions of people to stay connected with their friends. Due to the existence of information overload, the research on diffusion dynamics in epidemiology cannot be adopted directly to that in online social networks. In this paper, we consider diffusion dynamics in online social networks subject to information overload, and model the information-processing process of a user by a queue with a batch arrival and a finite buffer. We use the average number of times a message is processed after it is generated by a given user to characterize the user influence, which is then estimated through theoretical analysis for a given network. We validate the accuracy of our estimation by simulations, and apply the results to study the impacts of different factors on the user influence. Among the observations, we find that the impact of network size on the user influence is marginal while the user influence decreases with assortativity due to information overload, which is particularly interesting. [ABSTRACT FROM AUTHOR]