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

Related topics

Related topics

49 relations
Algebraic connectivityBruce Reed (mathematician)Chromatic polynomialClique problem
Expand

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Random Graphs and Complex Networks
  • R. Hofstad
  • Cambridge Series in Statistical and Probabilistic…
  • 2016
    • Corpus ID: 30744144
In this chapter, we draw motivation from real-world networks, and formulate random graph models for them. We focus on some of the… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The Diameter of a Scale-Free Random Graph
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
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Modern Graph Theory
  • 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
Is this relevant?
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
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Spectral partitioning of random graphs
  • 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
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The degree sequence of a scale-free random graph process
Recently, Barabasi and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A random graph model for massive graphs
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
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A Critical Point for Random Graphs with a Given Degree Sequence
Given a sequence of nonnegative real numbers λ0, λ1… which sum to 1, we consider random graphs having approximately λi n vertices… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
On the evolution of random graphs
(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
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE