Bootstrap quantification of estimation uncertainties in network degree distributions

• Published in: Scientific reports 2017-07, Vol.7 (1), p.5807-12, Article 5807
• Main Authors: Gel, Yulia R., Lyubchich, Vyacheslav, Ramirez Ramirez, L. Leticia
• Format: Article
• Language: English
• Subjects: 639/705/1042; 639/705/117; 639/705/531; Algorithms; Collaboration; Computer science; Confidence intervals; Data processing; Humanities and Social Sciences; multidisciplinary; Science; Science (multidisciplinary); Time series
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-017-05885-x

We propose a new method of nonparametric bootstrap to quantify estimation uncertainties in functions of network degree distribution in large ultra sparse networks. Both network degree distribution and network order are assumed to be unknown. The key idea is based on adaptation of the “blocking” argument, developed for bootstrapping of time series and re-tiling of spatial data, to random networks. We first sample a set of multiple ego networks of varying orders that form a patch, or a network block analogue, and then resample the data within patches. To select an optimal patch size, we develop a new computationally efficient and data-driven cross-validation algorithm. The proposed fast patchwork bootstrap (FPB) methodology further extends the ideas for a case of network mean degree, to inference on a degree distribution. In addition, the FPB is substantially less computationally expensive, requires less information on a graph, and is free from nuisance parameters. In our simulation study, we show that the new bootstrap method outperforms competing approaches by providing sharper and better-calibrated confidence intervals for functions of a network degree distribution than other available approaches, including the cases of networks in an ultra sparse regime. We illustrate the FPB in application to collaboration networks in statistics and computer science and to Wikipedia networks.