Many different random graph constructions are used
to model large real life graphs. Often it is not clear,
however, how the strength of the different models
compare to each other, e.g., when does it hold that a
certain model class contains another. We are particularly
interested in random graph models that arise
via abstract geometric constructions, motivated by
the fact that these graphs can model certain wireless
communication networks. We set up a general
framework to compare the strength of random graph
models, and present some results about the equality,
inequality and proper containment of certain model
classes, as well as some open problems.
Cite as: Farago, A. (2009). Structural Properties of Random Graph Models. In Proc. Fifteenth Computing: The Australasian Theory Symposium (CATS 2009), Wellington, New Zealand. CRPIT, 94. Downey, R. and Manyem, P., Eds. ACS. 129-136.
(from crpit.com)
(local if available)