Heterogeneous clustered random graphs
Warwick Mathematics Institute, University of Warwick - Coventry, CV4 7AL, UK
Received: 5 December 2013
Accepted: 12 March 2014
A graph Hamiltonian is proposed that allows creation of random networks close to specified connectivity, degree heterogeneity, and clustering.
PACS: 89.75.Hc – Networks and genealogical trees / 02.70.Uu – Applications of Monte Carlo methods / 89.75.-k – Complex systems
© EPLA, 2014