Literature DB >> 33568743

Measurement error of network clustering coefficients under randomly missing nodes.

Kazuki Nakajima1, Kazuyuki Shudo2.   

Abstract

The measurement error of the network topology caused by missing network data during the collection process is a major concern in analyzing collected network data. It is essential to clarify the error between the properties of an original network and the collected network to provide an accurate analysis of the entire topology. However, the measurement error of the clustering coefficient, which is a fundamental network property, has not been well understood particularly from an analytical perspective. Here we analytically and numerically investigate the measurement error of two types of clustering coefficients, namely, the global clustering coefficient and the network average clustering coefficient, of a network that is randomly missing some proportion of the nodes. First, we derive the expected error of the clustering coefficients of an incomplete network given a set of randomly missing nodes. We analytically show that (i) the global clustering coefficient of the incomplete network has little expected error and that (ii) conversely, the network average clustering coefficient of the incomplete network is underestimated with an expected error that is dependent on a property that is specific to the graph. Then, we verify the analytical claims through numerical simulations using three typical network models, i.e., the Erdős-Rényi model, the Watts-Strogatz model, and the Barabási-Albert model, and the 15 real-world network datasets consisting of five network types. Although the simulation results on the three typical network models suggest that the measurement error of the clustering coefficients on graphs with considerably small clustering coefficients may not behave like the analytical claims, we demonstrate that the simulation results on real-world networks that typically have enough high clustering coefficients sufficiently support our analytical claims. This study facilitates an analytical understanding of the measurement error in network properties due to missing graph data.

Entities:  

Year:  2021        PMID: 33568743      PMCID: PMC7876024          DOI: 10.1038/s41598-021-82367-1

Source DB:  PubMed          Journal:  Sci Rep        ISSN: 2045-2322            Impact factor:   4.379


  16 in total

1.  Emergence of scaling in random networks

Authors: 
Journal:  Science       Date:  1999-10-15       Impact factor: 47.728

2.  Network robustness and fragility: percolation on random graphs.

Authors:  D S Callaway; M E Newman; S H Strogatz; D J Watts
Journal:  Phys Rev Lett       Date:  2000-12-18       Impact factor: 9.161

3.  Error and attack tolerance of complex networks

Authors: 
Journal:  Nature       Date:  2000-07-27       Impact factor: 49.962

4.  Network motifs: simple building blocks of complex networks.

Authors:  R Milo; S Shen-Orr; S Itzkovitz; N Kashtan; D Chklovskii; U Alon
Journal:  Science       Date:  2002-10-25       Impact factor: 47.728

5.  Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations.

Authors:  Alexei Vázquez
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2003-05-07

6.  Models of social networks based on social distance attachment.

Authors:  Marián Boguñá; Romualdo Pastor-Satorras; Albert Díaz-Guilera; Alex Arenas
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2004-11-22

7.  Tuning clustering in random networks with arbitrary degree distributions.

Authors:  M Angeles Serrano; Marián Boguñá
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2005-09-30

8.  Accuracy and scaling phenomena in Internet mapping.

Authors:  Aaron Clauset; Cristopher Moore
Journal:  Phys Rev Lett       Date:  2005-01-06       Impact factor: 9.161

9.  Collective dynamics of 'small-world' networks.

Authors:  D J Watts; S H Strogatz
Journal:  Nature       Date:  1998-06-04       Impact factor: 49.962

10.  Quantifying randomness in real networks.

Authors:  Chiara Orsini; Marija M Dankulov; Pol Colomer-de-Simón; Almerima Jamakovic; Priya Mahadevan; Amin Vahdat; Kevin E Bassler; Zoltán Toroczkai; Marián Boguñá; Guido Caldarelli; Santo Fortunato; Dmitri Krioukov
Journal:  Nat Commun       Date:  2015-10-20       Impact factor: 14.919

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.