Yael Artzy-Randrup
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yael Artzy-Randrup has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Lewi Stone
Mathematical Sciences School of Science RMIT University Melbourne Australia
2 shared publications - Mina Teicher
Department of Mathematics, Bar Ilan University, Israel
1 shared publication - Yakir Berchenko
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
1 shared publication
Latest Publications
- 12 August 2009
- Published by Springer Nature
- p. 237-252
The Big Friendly Giant: The Giant Component in Clustered Random Graphs
- 12 August 2009
- Published by Springer Nature
- p. 237-252
The Big Friendly Giant: The Giant Component in Clustered Random Graphs
- 16 November 2005
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (5) , 056708
Generating uniformly distributed random networks
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.
- 16 November 2005
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (5) , 056708
Generating uniformly distributed random networks
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.