Skip to search formSkip to main contentSkip to account menu

Rado graph

Known as: Countable random graph, The random graph 
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
BIT predicateClique (graph theory)CombinatoricaDirected graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Achlioptas process phase transitions are continuous
It is widely believed that certain simple modifications of the random graph process lead to discontinuous phase transitions. In… 
Highly Cited
2011
Highly Cited
2011
Optimal Packings of Hamilton Cycles in Sparse Random Graphs
We prove that there exists a positive constant $\varepsilon$ such that if $\log n / n \leq p \leq n^{-1+\varepsilon}$, then… 
2010
2010
Minimal functions on the random graph
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non… 
Highly Cited
2010
Highly Cited
2010
Majority bootstrap percolation on the random graph G(n,p)
Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the… 
Highly Cited
2008
Highly Cited
2008
Sparse random graphs with clustering
In 2007, we introduced a general model of sparse random graphs with (conditional) independence between the edges. The aim of this… 
Highly Cited
2007
Highly Cited
2007
On the relationship between the algebraic connectivity and graph's robustness to node and link failures
We study the algebraic connectivity in relation to the graph's robustness to node and link failures. Graph's robustness is… 
Highly Cited
2004
Highly Cited
2004
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like… 
Highly Cited
2004
Highly Cited
2004
On the power-law random graph model of massive data networks
Highly Cited
2001
Highly Cited
2001
Towards compressing Web graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for… 
Highly Cited
1985
Highly Cited
1985
Limitations of concurrency in transaction processing
Given the pairwise probability of conflict p among transactions in a transaction processing system, together with the total… 
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)