Degree-preserving randomization

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by DGaffney (talk | contribs) at 06:36, 6 November 2014 (Created page with ''''Degree Preserving Randomization''' is a technique used in Network Science that aims to assess whether or not variations observed in a given graph could si...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Degree Preserving Randomization is a technique used in Network Science that aims to assess whether or not variations observed in a given graph could simply be an artifact of the graph's inherent structural properties rather than properties unique to the nodes, in an observed network.