title: Sampling properties of random graphs: the degree distribution.
abstract: We discuss two sampling schemes for selecting random subnets from a network, random sampling and connectivity dependent sampling, and investigate how the degree distribution of a node in the network is affected by the two types of sampling. Here we derive a necessary and sufficient condition that guarantees that the degree distributions of the subnet and the true network belong to the same family of probability distributions. For completely random sampling of nodes we find that this condition is satisfied by classical random graphs; for the vast majority of networks this condition will, however, not be met. We furthermore discuss the case where the probability of sampling a node depends on the degree of a node and we find that even classical random graphs are no longer closed under this sampling regime. We conclude by relating the results to real Eschericia coli protein interaction network data.
authors.affiliation: Centre for Bioinformatics, Division of Molecular Biosciences, Imperial College London, Wolfson Building, London SW7 2AZ, United Kingdom. m.stumpf@imperial.ac.uk
authors.forename: Michael P H
authors.initials: MP
authors.lastname: Stumpf
authors.forename: Carsten
authors.initials: C
authors.lastname: Wiuf