Child pages
  • Node Sampling
Skip to end of metadata
Go to start of metadata

N nodes at random are selected from the graph. All edges among those n nodes are added to the new graph. Unattached nodes are then dropped.


This is one of the simplest sampling techniques for obtaining a subset of the data to work with.


S. H. Lee, P-J. Kim, and H. Jeong. (2006) Statistical properties of sampled networks. Physical Review E 73.

See Also

The license could not be verified: License Certificate has expired! Generate a Free license now.

  • No labels