Aiello, W
Chung, F
Lu, L
Abstract
| We propose a random graph model which is a special case of sparse
random graphs with given degree sequences. This model involves only
a small number of parameters, called logsize and log-log growth
rate. These parameters capture some universal characteristics of
massive graphs. Furthermore, from these parameters, various properties
of the graph can be derived. For example, for certain ranges of the
parameters, we will compute the expected distribution of the sizes
of the connected components
|
Keywords
topology
topology generator
Notes
Related Papers
Bibtex
@inproceedings{aiello.chung.lu_random00,
author = "William Aiello and Fan Chung and Linyuan Lu",
title = "A random graph model for massive graphs",
pages = "171--180",
booktitle = "Proceedings of the 32nd Annual Symposium on Theory of Computing",
year = "2000",
url = "citeseer.nj.nec.com/266339.html" }