scispace - formally typeset
Journal ArticleDOI

Information cascades in complex networks

Mahdi Jalili, +1 more
- 01 Oct 2017 - 
- Vol. 5, Iss: 5, pp 665-693
Reads0
Chats0
TLDR
Simulation results on sample networks reveal just how relevant the centrality of initiator nodes is on the latter development of an information cascade, and the spreading influence of a node is defined as the fraction of nodes that is activated as a result of the initial activation of that node.
Abstract
Information cascades are important dynamical processes in complex networks. An information cascade can describe the spreading dynamics of rumour, disease, memes, or marketing campaigns, which initially start from a node or a set of nodes in the network. If conditions are right, information cascades rapidly encompass large parts of the network, thus leading to epidemics or epidemic spreading. Certain network topologies are particularly conducive to epidemics, while others decelerate and even prohibit rapid information spreading. Here we review models that describe information cascades in complex networks, with an emphasis on the role and consequences of node centrality. In particular, we present simulation results on sample networks that reveal just how relevant the centrality of initiator nodes is on the latter development of an information cascade, and we define the spreading influence of a node as the fraction of nodes that is activated as a result of the initial activation of that node. A systemic review of existing results shows that some centrality measures, such as the degree and betweenness, are positively correlated with the spreading influence, while other centrality measures, such as eccentricity and the information index, have negative correlation. A positive correlation implies that choosing a node with the highest centrality value will activate the largest number of nodes, while a negative correlation implies that the node with the lowest centrality value will have the same effect.We discuss possible applications of these results, and we emphasize how information cascades can help us identify nodes with the highest spreading capability in complex networks.

read more

Citations
More filters
Journal ArticleDOI

Sequential Recovery of Complex Networks Suffering From Cascading Failure Blackouts

TL;DR: A novel sequential recovery model is proposed that takes into consideration both the operating mechanism of complex power transmission networks and potential cascading failures triggered during the recovery process, and a new tool called the sequential recovery graph (SRG) to identify the critical nodes and the order of their restorations which lead to better performance in the Recovery process.
Journal ArticleDOI

The epidemic spreading on the multi-relationships network

TL;DR: A novel immunization to overcome the limitations of traditional immunization strategy, which has been proven a satisfying desirable performance on controlling disease transmission is proposed.
Journal ArticleDOI

Co-diffusion of social contagions

TL;DR: In this paper, a threshold model for the diffusion of multiple contagions is proposed, where individuals are placed on a multiplex network with a periodic lattice and a random-regular-graph layer.
Journal ArticleDOI

Extended methods for influence maximization in dynamic networks.

TL;DR: Three new approximation methods (Dynamic Degree Discount, Dynamic CI, and Dynamic RIS) are proposed for influence maximization problem in dynamic networks, which are the extensions of previous methods for static networks to dynamic networks.
Journal ArticleDOI

Identifying Brain Networks at Multiple Time Scales via Deep Recurrent Neural Network

TL;DR: Experimental results on the motor task fMRI data of Human Connectome Project 900 subjects release demonstrated that the proposed DRNN can not only faithfully reconstruct functional brain networks, but also identify more meaningful brain networks with multiple time scales which are overlooked by traditional shallow models.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI

Statistical mechanics of complex networks

TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Journal ArticleDOI

Centrality in social networks conceptual clarification

TL;DR: In this article, three distinct intuitive notions of centrality are uncovered and existing measures are refined to embody these conceptions, and the implications of these measures for the experimental study of small groups are examined.
Journal ArticleDOI

Community structure in social and biological networks

TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Related Papers (5)