Structural properties of random graph models

Authors:
András Faragó
Affiliations:
The University of Texas at Dallas, Richardson, Texas
Venue:
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Year:
2009

Citing 2
Cited 1

Handbook of Graphs and Networks: From the Genome to the Internet

Handbook of Graphs and Networks: From the Genome to the Internet
On the Fundamental Limits of Topology Control in Ad Hoc Networks

Algorithmica

Network topology models for multihop wireless networks

ISRN Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.