Back to search

Physical Review E

Random Networks with Tunable Degree Distribution and Clustering

Abstract

dc:description.abstract

We present an algorithm for generating random networks with arbitrary degree distribution and clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and poisson degree distributions with variable levels of clustering. Such networks may be used as models of social networks and as a testable null hypothesis about network structure. Finally, we explore the effects of clustering on the point of the phase transition where a giant component forms in a random network, and on the size of the giant component. Some analysis of these effects is presented.

Degree

thesis:*
Grantor dc:publisher
Physical Review E
Year dc:date.issued
2004

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Volz, Erik

Subjects

dc:subject × 1

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
6475970
Dc Identifier Citation
Phys. Rev. E, 70, 056115

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Volz, Erik. Random Networks with Tunable Degree Distribution and Clustering. Physical Review E, 2004. https://hdl.handle.net/1813/226