Abstract
AbstractThe importance of identifying mesoscale structures in complex networks can be hardly overestimated. So far, much attention has been devoted to detect modular and bimodular structures on binary networks. This effort has led to the definition of a framework based upon the score function called ‘surprise’, i.e. a p-value that can be assigned to any given partition of nodes. Hereby, we make a step further and extend the entire framework to the weighted case: six variants of surprise, induced by just as many variants of the hypergeometric distribution, are, thus, considered. As a result, a general, statistically grounded approach for detecting mesoscale network structures via a unified, suprise-based framework is presented. To illustrate its performances, both synthetic benchmarks and real-world configurations are considered. Moreover, we attach to the paper a Python code implementing all variants of surprise discussed in the present manuscript.
Funder
EU project SoBigData-PlusPlus
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy
Reference43 articles.
1. Fortunato, S. & Hric, D. Community detection in networks: a user guide. Phys. Rep. 659, 1–44 (2016).
2. Khan, B. S. & Niazi, M. A. Network community detection: a review and visual survey. Preprint at https://arxiv.org/abs/1708.00977 (2017).
3. Borgatti, S. P. & Everett, M. G. Models of core/periphery structures. Soc. Netw. 21, 375–395 (2000).
4. Craig, B. & Von Peter, G. Interbank tiering and money center banks. J. Financ. Intermed. 23, 322–347 (2014).
5. Van Lelyveld, I. et al. Finding the core: Network structure in interbank markets. J. Bank. Financ. 49, 27–40 (2014).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献