In network theory, a giant component is a connected component of a given random graph that contains a constant fraction of the entire graph'sâ€¦Â (More)

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

2009

2009

- Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
- IEEE Transactions on Vehicular Technology
- 2009

In this paper, we study transmission power to secure the connectivity of a network. Instead of requiring all nodes to beâ€¦Â (More)

Is this relevant?

2009

2009

- Svante Janson, Malwina J. Luczak
- Random Struct. Algorithms
- 2009

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n â†’ âˆž. Then, underâ€¦Â (More)

Is this relevant?

2009

2009

- Joel Q. Spencer
- 2009

Oftentimes the beginnings of a mathematical area are obscure or disputed. The subject of Random Graphs had, however, a clearâ€¦Â (More)

Is this relevant?

2007

2007

The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assignedâ€¦Â (More)

Is this relevant?

2007

2007

- Joel H. Spencer, Nicholas C. Wormald
- Combinatorica
- 2007

The standard ErdÅ‘s-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is addedâ€¦Â (More)

Is this relevant?

2006

2006

- Tom Bohman, David Kravitz
- Combinatorics, Probability & Computing
- 2006

Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosenâ€¦Â (More)

Is this relevant?

2006

2006

- Fan Chung Graham, Linyuan Lu
- SIAM J. Discrete Math.
- 2006

We consider the random graph model G(w) for a given expected degree sequence w = (w1, w2, . . . , wn). If the expected averageâ€¦Â (More)

Is this relevant?

2004

2004

- Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin
- LATIN
- 2004

Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pairâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

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

1998

Highly Cited

1998

- Michael Molloy, Bruce A. Reed
- Combinatorics, Probability & Computing
- 1998

Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degreeâ€¦Â (More)

Is this relevant?