Abstract
Most studies of networks have only looked at small subsets of the true network. Here, we discuss the sampling properties of a network's degree distribution under the most parsimonious sampling scheme. Only if the degree distributions of the network and randomly sampled subnets belong to the same family of probability distributions is it possible to extrapolate from subnet data to properties of the global network. We show that this condition is indeed satisfied for some important classes of networks, notably classical random graphs and exponential random graphs. For scale-free degree distributions, however, this is not the case. Thus, inferences about the scale-free nature of a network may have to be treated with some caution. The work presented here has important implications for the analysis of molecular networks as well as for graph theory and the theory of networks in general.
| Original language | English |
|---|---|
| Journal | Proceedings of the National Academy of Sciences of the United States of America |
| Volume | 102 |
| Issue number | 12 |
| Pages (from-to) | 4221-4224 |
| Number of pages | 4 |
| ISSN | 0027-8424 |
| DOIs | |
| Publication status | Published - 22 Mar 2005 |
| Externally published | Yes |
Keywords
- Complex networks
- Protein interaction networks
- Random graphs
- Sampling theory