Heterogeneous clustered random graphs

T House

doi:10.1209/0295-5075/105/68006

Heterogeneous clustered random graphs

Research output: Contribution to journal › Article › peer-review

Abstract

A graph Hamiltonian is proposed that allows creation of random networks close to specified connectivity, degree heterogeneity, and clustering. ?? Copyright EPLA, 2014.

Original language	English
Journal	EPL
Volume	105
Issue number	6
DOIs	https://doi.org/10.1209/0295-5075/105/68006
Publication status	Published - 2014

Access to Document

10.1209/0295-5075/105/68006

Cite this

@article{cb54fb36acab4d17af6366da698f82db,

title = "Heterogeneous clustered random graphs",

abstract = "A graph Hamiltonian is proposed that allows creation of random networks close to specified connectivity, degree heterogeneity, and clustering. ?? Copyright EPLA, 2014.",

author = "T House",

note = "cited By 0",

year = "2014",

doi = "10.1209/0295-5075/105/68006",

language = "English",

volume = "105",

journal = "Europhysics Letters",

issn = "0295-5075",

publisher = "EDP Sciences",

number = "6",

}

TY - JOUR

T1 - Heterogeneous clustered random graphs

AU - House, T

N1 - cited By 0

PY - 2014

Y1 - 2014

N2 - A graph Hamiltonian is proposed that allows creation of random networks close to specified connectivity, degree heterogeneity, and clustering. ?? Copyright EPLA, 2014.

AB - A graph Hamiltonian is proposed that allows creation of random networks close to specified connectivity, degree heterogeneity, and clustering. ?? Copyright EPLA, 2014.

U2 - 10.1209/0295-5075/105/68006

DO - 10.1209/0295-5075/105/68006

M3 - Article

VL - 105

JO - Europhysics Letters

JF - Europhysics Letters

SN - 0295-5075

IS - 6

ER -

Heterogeneous clustered random graphs

Abstract

Access to Document

Fingerprint

Cite this