# Random graph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- TKDD
- 2007

How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Combinatorica
- 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… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Random Struct. Algorithms
- 2001

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

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Experimental Mathematics
- 2001

We propose a random graph model which is a special case of sparse random graphs with given degree sequences which satisfy a power… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- STOC
- 2000

We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- SODA
- 1998

We consider the following probabilistic model of a graph on n labeled vertices. First choose a random graph G(n, 1/2) and then… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Random Struct. Algorithms
- 1995

Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n… (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- SIAM J. Comput.
- 1980

Abstract. A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i .e. all but o(2 (2… (More)

Is this relevant?

Highly Cited

1960

Highly Cited

1960

- 1960

(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… (More)

Is this relevant?