Generating uniformly distributed random networks

被引:62
作者
Artzy-Randrup, Y [1 ]
Stone, L [1 ]
机构
[1] Tel Aviv Univ, Fac Life Sci, Biomath Unit, IL-69978 Tel Aviv, Israel
来源
PHYSICAL REVIEW E | 2005年 / 72卷 / 05期
关键词
D O I
10.1103/PhysRevE.72.056708
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
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.
引用
收藏
页数:7
相关论文
共 25 条
[1]  
Artzy-Randrup Y, 2004, SCIENCE, V305
[2]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]   NEW ALGORITHM FOR MONTE-CARLO SIMULATION OF ISING SPIN SYSTEMS [J].
BORTZ, AB ;
KALOS, MH ;
LEBOWITZ, JL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1975, 17 (01) :10-18
[4]   Faster Monte Carlo simulations at low temperatures. The waiting time method [J].
Dall, J ;
Sibani, P .
COMPUTER PHYSICS COMMUNICATIONS, 2001, 141 (02) :260-267
[5]   GENERAL METHOD FOR NUMERICALLY SIMULATING STOCHASTIC TIME EVOLUTION OF COUPLED CHEMICAL-REACTIONS [J].
GILLESPIE, DT .
JOURNAL OF COMPUTATIONAL PHYSICS, 1976, 22 (04) :403-434
[6]  
Gotelli NJ, 2002, ECOLOGY, V83, P2091, DOI 10.1890/0012-9658(2002)083[2091:SCOAMA]2.0.CO
[7]  
2
[8]  
Gotelli NJ, 1996, NULL MODELS ECOLOGY, DOI DOI 10.2307/2265928
[9]   Reply to "Comment on 'Subgraphs in random networks' " [J].
Itzkovitz, S ;
Milo, R ;
Kashtan, N ;
Newman, MEJ ;
Alon, U .
PHYSICAL REVIEW E, 2004, 70 (05) :2
[10]   Comment on "Subgraphs in random networks" [J].
Kino, OD .
PHYSICAL REVIEW E, 2004, 70 (05) :3