Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Random graph

Known as: Pseudorandom graph, Random network, Probabilistic graph theory 
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
1. Overview 2. Erdos-Renyi random graphs 3. Fixed degree distributions 4. Power laws 5. Small worlds 6. Random walks 7. CHKNS… Expand
Review
2006
Review
2006
We will review some of the major results in random graphs and some of the more challenging open problems. We will cover… Expand
Highly Cited
2004
Highly Cited
2004
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of… Expand
Highly Cited
2002
Highly Cited
2002
  • B. Bollobás
  • Graduate Texts in Mathematics
  • 2002
  • Corpus ID: 120529008
This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with… Expand
Highly Cited
2001
Highly Cited
2001
Let E,, .V denote the set of all graphs having n given labelled vertices VI, L’s;,., Vn and N edges. The graphs considered are… Expand
Highly Cited
2001
Highly Cited
2001
Recently, Barabasi and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… Expand
Highly Cited
2001
Highly Cited
2001
  • F. McSherry
  • Proceedings IEEE International Conference on…
  • 2001
  • Corpus ID: 10389217
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved… Expand
Highly Cited
2000
Highly Cited
2000
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1995
Highly Cited
1995
Given a sequence of nonnegative real numbers λ0, λ1… which sum to 1, we consider random graphs having approximately λi n vertices… Expand
Highly Cited
1984
Highly Cited
1984
(n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N… Expand
  • figure 2
  • figure 3