Volume 105, Number 6, March 2014
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||31 March 2014|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.