geometric random graphs
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 1)

H-INDEX

4
(FIVE YEARS 0)

2021 ◽  
pp. 23-41
Author(s):  
Omer Angel ◽  
Yinon Spinka

2019 ◽  
Vol 79 ◽  
pp. 1-14
Author(s):  
Anthony Bonato ◽  
Jeannette Janssen ◽  
Anthony Quas

10.37236/597 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Elizabeth Beer ◽  
James Allen Fill ◽  
Svante Janson ◽  
Edward R. Scheinerman

We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs, vertex random graphs are generalizations of geometric random graphs, and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in the edges, in the vertices, or in both. We show that vertex-edge random graphs, ostensibly the most general of the three models, can be approximated arbitrarily closely by vertex random graphs, but that the two categories are distinct.


Sign in / Sign up

Export Citation Format

Share Document