Influence maximization by rumor spreading on correlated networks through community identification

  title={Influence maximization by rumor spreading on correlated networks through community identification},
  author={Didier Augusto Vega-Oliveros and Luciano da Fontoura Costa and Francisco Aparecido Rodrigues},
  journal={Commun. Nonlinear Sci. Numer. Simul.},

Figures and Tables from this paper

MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks
A novel semi-local algorithm named as modified degree centrality with exclusion ratio is proposed to identify influential nodes from diverse locations in the network to ensure minimum overlapping between regions influenced by the chosen spreader nodes.
Optimal Control of ISTR Rumor Propagation Model with Social Reinforcement in Heterogeneous Network
The wide spread of rumor is undoubtedly harmful to social stability; we should try to lower the effect of rumor on society. Therefore, it is reasonable to put forward the rumor control strategy on
Evaluating importance of nodes in complex networks with local volume information dimension
A new approach called local volume information dimension is proposed, in which the sum of degree of nodes within different distances of central node is calculated and the information within the certain distance is described by the information entropy.
Study On Coupled Social Network Public Opinion Communication Based On Improved SEIR
  • Changbing Jiang, Yaoyuan Zhang, Hu Wang, Y. Zhou, Yueqi Zou
  • Computer Science
    2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)
  • 2020
Experiments show that the constructed SEI2R can better simulate the public opinion dissemination process in the network, and the propagation law of thepublic opinion WeChat and Weibo coupled double-layer network is studied through matlab simulation.
Immune Algorithm to Suppress Rumor Propagation Based on Influence Maximization
An immune method based on two-stage influence maximization to suppress rumor propagation is proposed and shows that the IS-APWUC method has a better rumor suppression effect than the similar correlation algorithms.
Social network node influence maximization method combined with degree discount and local node optimization
The proposed DLIM algorithm is reasonable and effective and can be applied in network marketing, product recommendation, and other fields and improves the propagation range by 11.3% compared with the traditional degree discount algorithm.
A modified gravity model based on network efficiency for vital nodes identification in complex networks
A novel and improved gravity model that integrates gravity model and network efficiency, which considers the effect of the nodes on structure robustness of the network better is proposed and solidate the superiority of the proposed method.


Influence maximization on correlated networks through community identification
This paper introduces a new method to find the set of initial spreaders to maximize the information propagation in complex networks and evaluates this method in assortative networks, verifying that degree-degree correlation plays a fundamental role on the spreading dynamics.
Spreader Selection by Community to Maximize Information Diffusion in Social Networks
This paper proposes an approach for maximizing the information diffusion by selecting the most important (central) users from communities by analyzing the selection of the most central vertices of the network.
Rumor propagation with heterogeneous transmission in social networks
By extensive numerical simulations, this work finds that the spreading is improved in scale-free networks when the transmission probability is proportional to PageRank, degree, and betweenness centrality.
Dynamics of rumor spreading in complex networks.
The mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks are derived and the time profiles for several quantities are numerically computed, which allows us to distinguish among different variants of rumor spreading algorithms.
Systematic comparison between methods for the detection of influential spreaders in complex networks
It is found that relatively simple network metrics, such as adaptive degree or closeness centralities, are able to achieve performances very close to the baseline value, thus providing good support for the use of these metrics in large-scale problem settings.
Local structure can identify and quantify influential global spreaders in large scale social networks
The finding that, without the knowledge of the entire network, any node’s global influence can be accurately measured using this characteristic number, which is independent of the network size, motivates an efficient algorithm with constant time complexity on the long-standing problem of best seed spreaders selection.
Influence maximization in complex networks through optimal percolation
This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.
Absence of influential spreaders in rumor dynamics
It is shown that the spreading capabilities of the nodes do not depend on their k-core index, which instead determines whether or not a given node prevents the diffusion of a rumor to a system-wide scale.
Influencers identification in complex networks through reaction-diffusion dynamics
It is shown that the new centrality metric significantly outperforms state-of-the-art metrics in detecting the influencers for global contagion processes and reveals the essential role of the network effective distance for the influencer identification and lead to the optimal solution of the problem.
Absence of epidemic threshold in scale-free networks with degree correlations.
This work provides for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing.