On vertex, edge, and vertex-edge random graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
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.
@article{10_37236_597,
author = {Elizabeth Beer and James Allen Fill and Svante Janson and Edward R. Scheinerman},
title = {On vertex, edge, and vertex-edge random graphs},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/597},
zbl = {1217.05205},
url = {http://geodesic.mathdoc.fr/articles/10.37236/597/}
}
TY - JOUR AU - Elizabeth Beer AU - James Allen Fill AU - Svante Janson AU - Edward R. Scheinerman TI - On vertex, edge, and vertex-edge random graphs JO - The electronic journal of combinatorics PY - 2011 VL - 18 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.37236/597/ DO - 10.37236/597 ID - 10_37236_597 ER -
Elizabeth Beer; James Allen Fill; Svante Janson; Edward R. Scheinerman. On vertex, edge, and vertex-edge random graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/597
Cité par Sources :