Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,215,042 papers from all fields of science
Search
Sign In
Create Free Account
Random graph
Known as:
Pseudorandom graph
, Random network
, Probabilistic graph theory
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Algebraic connectivity
Bruce Reed (mathematician)
Chromatic polynomial
Clique problem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
Random graph dynamics
R. Durrett
2007
Corpus ID: 118205845
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
Random graphs
A. Frieze
ACM-SIAM Symposium on Discrete Algorithms
2006
Corpus ID: 4506156
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
The Diameter of a Scale-Free Random Graph
B. Bollobás
,
O. Riordan
Comb.
2004
Corpus ID: 15239009
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
2001
Highly Cited
2001
The degree sequence of a scale‐free random graph process
B. Bollobás
,
O. Riordan
,
J. Spencer
,
G. Tusnády
Random Struct. Algorithms
2001
Corpus ID: 1486779
Recently, Barabási 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
Spectral partitioning of random graphs
Frank 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
2001
Highly Cited
2001
ON THE EVOLUTION OF RANDOM GRAPHS
A. Rbnyi
2001
Corpus ID: 9482089
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
2000
Highly Cited
2000
A random graph model for massive graphs
W. Aiello
,
F. Graham
,
Linyuan Lu
Symposium on the Theory of Computing
2000
Corpus ID: 2993917
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves…
Expand
Highly Cited
2000
Highly Cited
2000
Random graphs
A. Rucinski
ZOR Methods Model. Oper. Res.
2000
Corpus ID: 8708671
Let us consider a " random graph " r,:l,~v having n possible (labelled) vertices and N edges; in other words, let us choose at…
Expand
Highly Cited
1995
Highly Cited
1995
A Critical Point for Random Graphs with a Given Degree Sequence
Michael Molloy
,
B. Reed
Random Struct. Algorithms
1995
Corpus ID: 8830409
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
On the evolution of random graphs
P. Erdos
,
A. Rényi
1984
Corpus ID: 6829589
(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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE