Journal ArticleDOI
Information cascades in complex networks
Mahdi Jalili,Matjaž Perc +1 more
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
Enhanced recommender system using predictive network approach
TL;DR: A novel integrated recommendation approach based on the tools of network science to mitigate the sparsity problem is proposed, and the experimental results show that the proposed approach outperforms the earlier methods.
Journal ArticleDOI
Three-dimensional piecewise cloud representation for time series data mining
TL;DR: A novel representation method for time series data, which is named Three-Dimensional Piecewise Cloud Representation (TDPCR), is proposed, which achieves the reduction of the data dimensionality and captures distribution and variation features of segments.
Journal ArticleDOI
Sparse stacked autoencoder network for complex system monitoring with industrial applications
TL;DR: The experimental results show that the accuracy of the proposed method in the fault classification process is better than other methods and the fault isolation scheme can well locate the variable that caused the fault.
Journal ArticleDOI
The role of advanced and late provisions in a co-evolutionary epidemic game model for assessing the social triple-dilemma aspect.
TL;DR: This model provides a new perspective for evaluations of how much more advantageous and effective pre-emptive vaccination is in eradicating a communicable disease compared with late provisions such as late vaccination and self-protection and establishes the social efficiency deficit (SED) indicator for a triple-dilemma game to quantify the existence of a social dilemma.
Posted Content
A Communication-Efficient Algorithm for Exponentially Fast Non-Bayesian Learning in Networks
TL;DR: A novel distributed learning rule is proposed wherein agents aggregate neighboring beliefs based on a min-protocol, and the inter-communication intervals grow geometrically at a rate a ≥ 1, to achieve communication-efficient non-Bayesian learning over a network.
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
Michelle Girvan,Mark Newman +1 more
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.