Search Results

There are 20310 results for: content related to: Random graphs as models of networks

  1. You have free access to this content
    Techniques for analyzing dynamic random graph models of web-like networks: An overview

    Networks

    Volume 51, Issue 4, July 2008, Pages: 211–255, Aurel Cami and Narsingh Deo

    Article first published online : 14 DEC 2007, DOI: 10.1002/net.20215

  2. The phase transition in inhomogeneous random graphs

    Random Structures & Algorithms

    Volume 31, Issue 1, August 2007, Pages: 3–122, Béla Bollobás, Svante Janson and Oliver Riordan

    Article first published online : 1 JUN 2007, DOI: 10.1002/rsa.20168

  3. Sparse random graphs with clustering

    Random Structures & Algorithms

    Volume 38, Issue 3, May 2011, Pages: 269–323, Béla Bollobás, Svante Janson and Oliver Riordan

    Article first published online : 28 APR 2010, DOI: 10.1002/rsa.20322

  4. Mathematical results on scale-free random graphs

    Handbook of Graphs and Networks: From the Genome to the Internet

    Béla Bollobás, Oliver M. Riordan, Pages: 1–34, 2005

    Published Online : 28 JAN 2005, DOI: 10.1002/3527602755.ch1

  5. Network science

    Annual Review of Information Science and Technology

    Volume 41, Issue 1, 2007, Pages: 537–607, Katy Börner, Soma Sanyal and Alessandro Vespignani

    Article first published online : 27 OCT 2008, DOI: 10.1002/aris.2007.1440410119

  6. Sparse graphs: Metrics and random models

    Random Structures & Algorithms

    Volume 39, Issue 1, August 2011, Pages: 1–38, Béla Bollobás and Oliver Riordan

    Article first published online : 20 JUL 2010, DOI: 10.1002/rsa.20334

  7. Law of large numbers for the SIR epidemic on a random graph with given degrees

    Random Structures & Algorithms

    Volume 45, Issue 4, December 2014, Pages: 726–763, Svante Janson, Malwina Luczak and Peter Windridge

    Article first published online : 21 OCT 2014, DOI: 10.1002/rsa.20575

  8. The diameter of sparse random graphs

    Random Structures & Algorithms

    Volume 31, Issue 4, December 2007, Pages: 482–516, Daniel Fernholz and Vijaya Ramachandran

    Article first published online : 3 OCT 2007, DOI: 10.1002/rsa.20197

  9. Topology discovery of sparse random graphs with few participants

    Random Structures & Algorithms

    Volume 43, Issue 1, August 2013, Pages: 16–48, Animashree Anandkumar, Avinatan Hassidim and Jonathan Kelner

    Article first published online : 27 APR 2012, DOI: 10.1002/rsa.20420

  10. Aggregation models with limited choice and the multiplicative coalescent

    Random Structures & Algorithms

    Volume 46, Issue 1, January 2015, Pages: 55–116, Shankar Bhamidi, Amarjit Budhiraja and Xuan Wang

    Article first published online : 12 MAR 2013, DOI: 10.1002/rsa.20493

  11. Analytic Combinatorics on Random Graphs

    Analysis of Complex Networks: From Biology to Linguistics

    Michael Drmota, Bernhard Gittenberger, Pages: 425–450, 2009

    Published Online : 21 AUG 2009, DOI: 10.1002/9783527627981.ch17

  12. Anatomy of a young giant component in the random graph

    Random Structures & Algorithms

    Volume 39, Issue 2, September 2011, Pages: 139–178, Jian Ding, Jeong Han Kim, Eyal Lubetzky and Yuval Peres

    Article first published online : 15 SEP 2010, DOI: 10.1002/rsa.20342

  13. The Bohman-Frieze process near criticality

    Random Structures & Algorithms

    Volume 43, Issue 2, September 2013, Pages: 221–250, Mihyun Kang, Will Perkins and Joel Spencer

    Article first published online : 28 MAY 2012, DOI: 10.1002/rsa.20437

    Corrected by:

    Erratum: Erratum to “The Bohman-Frieze process near criticality”

    Vol. 46, Issue 4, 801, Article first published online: 30 MAR 2015

  14. Critical behavior in inhomogeneous random graphs

    Random Structures & Algorithms

    Volume 42, Issue 4, July 2013, Pages: 480–508, Remco van der Hofstad

    Article first published online : 28 AUG 2012, DOI: 10.1002/rsa.20450

  15. The mixing time of the giant component of a random graph

    Random Structures & Algorithms

    Volume 45, Issue 3, October 2014, Pages: 383–407, Itai Benjamini, Gady Kozma and Nicholas Wormald

    Article first published online : 14 MAY 2014, DOI: 10.1002/rsa.20539

  16. Spatial embedding and the structure of complex networks

    Complexity

    Volume 16, Issue 2, November/December 2010, Pages: 20–28, S. Bullock, L. Barnett and E. A. Di Paolo

    Article first published online : 30 AUG 2010, DOI: 10.1002/cplx.20338

  17. Ramsey games with giants

    Random Structures & Algorithms

    Volume 38, Issue 1-2, January - March 2011, Pages: 1–32, Tom Bohman, Alan Frieze, Michael Krivelevich, Po-Shen Loh and Benny Sudakov

    Article first published online : 21 OCT 2010, DOI: 10.1002/rsa.20343

  18. Graph construction and random graph generation for modeling protein structures

    Statistical Analysis and Data Mining: The ASA Data Science Journal

    Volume 6, Issue 6, December 2013, Pages: 482–495, Amy Wagaman

    Article first published online : 26 AUG 2013, DOI: 10.1002/sam.11203

  19. Structural properties of scale-free networks

    Handbook of Graphs and Networks: From the Genome to the Internet

    Reuven Cohen, Shlomo Havlin, Daniel ben-Avraham, Pages: 85–110, 2005

    Published Online : 28 JAN 2005, DOI: 10.1002/3527602755.ch4

  20. The phase transition in the uniformly grown random graph has infinite order

    Random Structures & Algorithms

    Volume 26, Issue 1-2, January - March 2005, Pages: 1–36, Béla Bollobás, Svante Janson and Oliver Riordan

    Article first published online : 28 OCT 2004, DOI: 10.1002/rsa.20041