Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,818,635 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
BIT predicate
Clique (graph theory)
Combinatorica
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Asymptotic resolution bounds of generalized modularity and statistically significant community detection
Xiaoyan Lu
,
B. Szymanski
arXiv.org
2019
Corpus ID: 267858560
The maximization of generalized modularity performs well on networks in which the members of all communities are statistically…
Expand
2019
2019
Graph Embedding VAE: A Permutation Invariant Model of Graph Structure
Tony Duan
,
Juho Lee
arXiv.org
2019
Corpus ID: 204743885
Generative models of graph structure have applications in biology and social sciences. The state of the art is GraphRNN, which…
Expand
2013
2013
On the Evolution of Random Geometric Graphs on Spaces of Negative Curvature
2013
Corpus ID: 18651290
We study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on the…
Expand
2013
2013
Guaranteed Sparse Recovery under Linear Transformation
Ji Liu
,
Lei Yuan
,
Jieping Ye
International Conference on Machine Learning
2013
Corpus ID: 7234421
We consider the following signal recovery problem: given a measurement matrix Φ ∈ Rn×p and a noisy observation vector c ∈ Rn…
Expand
2009
2009
Generating uncountable transformation semigroups
Y. Péresse
2009
Corpus ID: 117009305
We consider naturally occurring, uncountable transformation semigroups S and investigate the following three questions. (i) Is…
Expand
Review
2008
Review
2008
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs
L. Babai
,
D. West
2008
Corpus ID: 2483385
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map…
Expand
2004
2004
The Rado graph and the Urysohn space
P. Cameron
2004
Corpus ID: 11786708
Rado’s graph was published in 1964; Urysohn’s Polish space in 1927. There are many similarities between these two objects. These…
Expand
2002
2002
Fault Tolerant Sensor Networks with Bernoulli Nodes
Chih-Wei Yi
,
Peng-Jun Wan
,
Xiang-Yang Li
,
O. Frieder
2002
Corpus ID: 13937983
Connectivity, power consuming and fault tolerance are three critical issues in sensor networks. In this paper, sensor networks…
Expand
2002
2002
HIGH PERFORMANCE INTERCONNECTION NETWORKS
Aaron Harwood
2002
Corpus ID: 46659351
The thesis is concerned with the design of high performance interconnection networks for use predominantly in parallel computing…
Expand
1999
1999
Phase Transition for Parking Blocks, Brownian Excursion and Coalescence P. Chassaing
1999
Corpus ID: 264308636
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and ℓ = m − n empty…
Expand