Evolving Clustered Random Networks
Discrete Mathematics
2010-02-09 v1 Physics and Society
Abstract
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as generic models for studying the impacts of degree distributions and clustering on dynamical processes as well as null models for detecting other structural properties in empirical networks.
Cite
@article{arxiv.0808.0509,
title = {Evolving Clustered Random Networks},
author = {Shweta Bansal and Shashank Khandelwal and Lauren Ancel Meyers},
journal= {arXiv preprint arXiv:0808.0509},
year = {2010}
}