pith. sign in

arxiv: 0808.0509 · v1 · submitted 2008-08-04 · 💻 cs.DM · physics.soc-ph

Evolving Clustered Random Networks

classification 💻 cs.DM physics.soc-ph
keywords networksrandomclusteringdegreemodelsotheralgorithmchain
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.