Sampling properties of random graphs: the degree distribution

Details Sampling properties of random graphs: the degree distribution Sampling properties of random graphs: the degree distribution

2005-07-14

arxiv.org/abs/cond-mat/0507345v1

Physics

Condensed Matter

Statistical Mechanics

accepted for publication in Phys.Rev. E

Scientific paper

10.1103/PhysRevE.72.036118

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 distribution 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 fulfilled 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 {\it E.coli} protein interaction network data.

Affiliated with

Also associated with

No associations

Rating

Sampling properties of random graphs: the degree distribution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sampling properties of random graphs: the degree distribution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling properties of random graphs: the degree distribution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574999