Generation of arbitrarily two-point-correlated random networks

Sebastian Weber and Markus Porto
Phys. Rev. E 76, 046111 – Published 18 October 2007

Abstract

Random networks are intensively used as null models to investigate properties of complex networks. We describe an efficient and accurate algorithm to generate arbitrarily two-point degree-degree correlated undirected random networks without self-edges or multiple edges among vertices. With the goal to systematically investigate the influence of two-point correlations, we furthermore develop a formalism to construct a joint degree distribution P(j,k), which allows one to fix an arbitrary degree distribution P(k) and an arbitrary average nearest neighbor function knn(k) simultaneously. Using the presented algorithm, this formalism is demonstrated with scale-free networks [P(k)kγ] and empirical complex networks [P(k) taken from network] as examples. Finally, we generalize our algorithm to annealed networks which allows networks to be represented in a mean-field-like manner.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 14 February 2007

DOI:https://doi.org/10.1103/PhysRevE.76.046111

©2007 American Physical Society

Authors & Affiliations

Sebastian Weber and Markus Porto

  • Institut für Festkörperphysik, Technische Universität Darmstadt, Hochschulstrasse 8, 64289 Darmstadt, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 4 — October 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×