Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,215,042 papers from all fields of science

Search

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…

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…

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…

Highly Cited

2001

Highly Cited

2001

Recently, Barabási and Albert [2] suggested modeling complex real‐world networks such as the worldwide web as follows: consider a…

Highly Cited

2001

Highly Cited

2001

Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved…

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…

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…

Highly Cited

2000

Highly Cited

2000

Let us consider a " random graph " r,:l,~v having n possible (labelled) vertices and N edges; in other words, let us choose at…

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…

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…