Generating uniformly distributed random networks
- 16 November 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (5) , 056708
Abstract
The analysis of real networks taken from the biological, social, and physical sciences often requires a carefully posed statistical null-hypothesis approach. One common method requires comparing real networks to an ensemble of random matrices that satisfy realistic constraints in which each different matrix member is equiprobable. We discuss existing methods for generating uniformly distributed (constrained) random matrices, describe their shortcomings, and present an efficient technique that should have many practical applications.Keywords
This publication has 20 references indexed in Scilit:
- Comment on “Subgraphs in random networks”Physical Review E, 2004
- Reply to “Comment on ‘Subgraphs in random networks’ ”Physical Review E, 2004
- Comment on "Network Motifs: Simple Building Blocks of Complex Networks" and "Superfamilies of Evolved and Designed Networks"Science, 2004
- Superfamilies of Evolved and Designed NetworksScience, 2004
- Random binary matrices in biogeographical ecology—Instituting a good neighbor policyEnvironmental and Ecological Statistics, 2002
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- Specificity and Stability in Topology of Protein NetworksScience, 2002
- Collective dynamics of ‘small-world’ networksNature, 1998
- The checkerboard score and species distributionsOecologia, 1990
- Island-sharing by archipelago speciesOecologia, 1990