Related papers: Absence of influential spreaders in rumor dynamics
We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with a variant of the popular SIR model and then construct an estimator for the rumor source. This estimator…
In complex networks there are overlapping substructures or "circles" that consist of nodes belonging to multiple cohesive subgroups. Yet the role of these overlapping nodes in influence spreading processes remains underexplored. In the…
The structure of a network dramatically affects the spreading phenomena unfolding upon it. The contact distribution of the nodes has long been recognized as the key ingredient in influencing the outbreak events. However, limited knowledge…
We present the mathematical analysis of generalized complex contagions in clustered multiplex networks for susceptible-infected-recovered (SIR)-like dynamics. The model is intended to understand diffusion of influence, or any other…
A crucial aspect of a rumor detection model is its ability to generalize, particularly its ability to detect emerging, previously unknown rumors. Past research has indicated that content-based (i.e., using solely source posts as input)…
Most studies on social influence have focused on direct influence, while another interesting question can be raised as whether indirect influence exists between two users who're not directly connected in the network and what affects such…
Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and…
We propose an SIS competition model describing the propagation of conflicting rumors, such as fake news and its corrections. This simple model captures the interaction between rumor propagation and opinion dynamics, where rumors drive…
Recent research has explored the increasingly important role of social media by examining the dynamics of individual and group behavior, characterizing patterns of information diffusion, and identifying influential individuals. In this…
Traditional metrics of node influence such as degree or betweenness identify highly influential nodes, but are rarely usefully accurate in quantifying the spreading power of nodes which are not. Such nodes are the vast majority of the…
Most infectious diseases spread on a dynamic network of human interactions. Recent studies of social dynamics have provided evidence that spreading patterns may depend strongly on detailed micro-dynamics of the social system. We have…
Identifying influential nodes in a network is a major issue due to the great deal of applications concerned, such as disease spreading and rumor dynamics. That is why, a plethora of centrality measures has emerged over the years in order to…
Promoting information spreading is a booming research topic in network science community. However, the exiting studies about promoting information spreading seldom took into account the human memory, which plays an important role in the…
We propose a mathematical model to measure how multiple repetitions may influence in the ultimate proportion of the population never hearing a rumor during a given outbreak. The model is a multi-dimensional continuous-time Markov chain that…
Spreading processes have been largely studied in the literature, both analytically and by means of large-scale numerical simulations. These processes mainly include the propagation of diseases, rumors and information on top of a given…
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…
How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an…
We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the…
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential spreaders" for maximizing information dissemination and…
Contagion processes on networks, including disease spreading, information diffusion, or social behaviors propagation, can be modeled as simple contagion, i.e. involving one connection at a time, or as complex contagion, in which multiple…