Local structure can identify and quantify influential global spreaders in large scale social networks

DOI10.1073/PNAS.1710547115zbMATH Open1416.94083arXiv1509.03484OpenAlexW2804502241WikidataQ64123931 ScholiaQ64123931MaRDI QIDQ4967448FDOQ4967448

Authors: Yanqing Hu, Shenggong Ji, Yuliang Jin, Ling Feng, H. Eugene Stanley, Shlomo Havlin 

Publication date: 3 July 2019

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Abstract: Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a global process, it is commonly believed that measuring the influence of nodes inevitably requires the knowledge of the entire network. Employing percolation theory, we show that the spreading process displays a nucleation behavior: once a piece of information spread from the seeds to more than a small characteristic number of nodes, it reaches a point of no return and will quickly reach the percolation cluster, regardless of the entire network structure, otherwise the spreading will be contained locally. Thus, we find that, without the knowledge of entire network, any nodes' global influence can be accurately measured using this characteristic number, which is independent of the network size. This motivates an efficient algorithm with constant time complexity on the long standing problem of best seed spreaders selection, with performance remarkably close to the true optimum.

Full work available at URL: https://arxiv.org/abs/1509.03484

Recommendations

• Spreading dynamics in complex networks
• scientific article; zbMATH DE number 6474901
• Identifying influential spreaders in complex networks through local effective spreading paths
• Scalable influence maximization for independent cascade model in large-scale social networks
• Active influence spreading in social networks

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of design theory to circuits and networks (94C30)

Cited In (11)

• Power-law distribution of degree-degree distance: a better representation of the scale-free property of complex networks
• Evaluate node importance by decomposing network with a recursive percolation process
• Percolation on complex networks: theory and application
• Community detection based on first passage probabilities
• Epidemic behaviors in weighted networks with core-periphery structure
• Mining algorithm of E-Burt structural hole based on two-step neighbor
• Simplicial SIRS epidemic models with nonlinear incidence rates
• Random networks are heterogeneous exhibiting a multi-scaling law
• Influence maximization by rumor spreading on correlated networks through community identification
• Eradicating abrupt collapse on single network with dependency groups
• Using gossips to spread information: theory and evidence from two randomized controlled trials

This page was built for publication: Local structure can identify and quantify influential global spreaders in large scale social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967448)