Random graphs

By Alan M. Frieze. 2006

12,398 citations recorded by the source corpus.

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Statistical and Nonlinear Physics, Algorithms & Complexity, Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Bernhard Schölkopf
  2. Kun Zhang
  3. Sourav Chatterjee
  4. Charles Bordenave
  5. Jure Leskovec
  6. Santo Fortunato
  7. Clark Glymour
  8. Biwei Huang

In Discrete Mathematics and Combinatorics

  1. Jun Yin
  2. Horng-Tzer Yau
  3. Sourav Chatterjee
  4. Antti Knowles
  5. Van H. Vu
  6. Charles Bordenave
  7. Terence Tao
  8. L. Erdős

In Statistical and Nonlinear Physics

  1. Jure Leskovec
  2. Santo Fortunato
  3. Mark Newman
  4. Olaf Sporns
  5. M. A. Porter
  6. Alex Arenas
  7. D. Bassett
  8. Matjaz Perc

In Algorithms & Complexity

  1. M. A. Porter
  2. Jure Leskovec
  3. Marc Barthelemy
  4. Santo Fortunato
  5. D. Bassett
  6. E. Bullmore
  7. Renaud Lambiotte
  8. Darko Hric

In Network Science & Complex Systems

  1. Bernhard Schölkopf
  2. Santo Fortunato
  3. Marc Barthelemy
  4. D. Bassett
  5. M. A. Porter
  6. E. Bullmore
  7. Jure Leskovec
  8. Darko Hric

Citations in the corpus