Marcaccioli, R;
Livan, G;
(2019)
A Pólya urn approach to information filtering in complex networks.
Nature Communications
, 10
(1)
, Article 745. 10.1038/s41467-019-08667-3.
Preview |
Text
s41467-019-08667-3.pdf - Published Version Download (2MB) | Preview |
Abstract
The increasing availability of data demands for techniques to filter information in large complex networks of interactions. A number of approaches have been proposed to extract network backbones by assessing the statistical significance of links against null hypotheses of random interaction. Yet, it is well known that the growth of most real-world networks is non-random, as past interactions between nodes typically increase the likelihood of further interaction. Here, we propose a filtering methodology inspired by the Pólya urn, a combinatorial model driven by a self-reinforcement mechanism, which relies on a family of null hypotheses that can be calibrated to assess which links are statistically significant with respect to a given network's own heterogeneity. We provide a full characterization of the filter, and show that it selects links based on a non-trivial interplay between their local importance and the importance of the nodes they belong to.
Type: | Article |
---|---|
Title: | A Pólya urn approach to information filtering in complex networks |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1038/s41467-019-08667-3 |
Publisher version: | https://doi.org/10.1038/s41467-019-08667-3 |
Language: | English |
Additional information: | © The Author(s) 2019.Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/ licenses/by/4.0/. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10069403 |
Archive Staff Only
![]() |
View Item |