arrow
返回

A sampling-guided unsupervised learning method to capture percolation in complex networks

delete2022-03-09
delete1
delete
OA
AI
S
Sayat Mimar
G
Gourab Ghoshal *
DOI:10.1038/s41598-022-07921-xdelete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The use of machine learning methods in classical and quantum systems has led to novel techniques to classify ordered and disordered phases, as well as uncover transition points in critical phenomena. Efforts to extend these methods to dynamical processes in complex networks is a field of active research. Network-percolation, a measure of resilience and robustness to structural failures, as well as a proxy for spreading processes, has numerous applications in social, technological, and infrastructural systems. A particular challenge is to identify the existence of a percolation cluster in a network in the face of noisy data. Here, we consider bond-percolation, and introduce a sampling approach that leverages the core-periphery structure of such networks at a microscopic scale, using onion decomposition, a refined version of the k-core. By selecting subsets of nodes in a particular layer of the onion spectrum that follow similar trajectories in the percolation process, percolating phases can be distinguished from non-percolating ones through an unsupervised clustering method. Accuracy in the initial step is essential for extracting samples with information-rich content, that are subsequently used to predict the critical transition point through the confusion scheme, a recently introduced learning method. The method circumvents the difficulty of missing data or noisy measurements, as it allows for sampling nodes from both the core and periphery, as well as intermediate layers. We validate the effectiveness of our sampling strategy on a spectrum of synthetic network topologies, as well as on two real-word case studies: the integration time of the US domestic airport network, and the identification of the epidemic cluster of COVID-19 outbreaks in three major US states. The method proposed here allows for identifying phase transitions in empirical time-varying networks.
Keyword:
ROBUSTNESS
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Scientific Reports 封面图
Scientific Reports
IF:
3.9
论文数:
28.1W
被引数:
83.5W

机构

U
University of Rochester
学者数:
2.6W
论文数: 2.1W
被引数: 2.2W
引用论文

引用论文

Mutual information, neural networks and the renormalization group
err2018-03-26
err142
errOAAI
errKoch-Janusz, Maciej; Ringel, Zohar
err分享
err收藏
From the betweenness centrality in street networks to structural invariants in random planar graphs
err2018-06-27
err105
errOAAI
errKirkley, Alec; Barbosa, Hugo; Barthelemy, Marc; Ghoshal, Gourab
err分享
err收藏
Tuberculina: rust relatives attack rusts 结核菌 : 锈病亲属攻击锈病
err2017-01-30
err0
PREAI
errMatthias Lutz; Robert Bauer; Dominik Begerow; Franz Oberwinkler; Dagmar Triebel
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容