Generating correlated networks from uncorrelated ones

A. Ramezanpour, V. Karimipour, and A. Mashaghi
Phys. Rev. E 67, 046107 – Published 15 April 2003
PDFExport Citation

Abstract

Given an ensemble of random graphs with a specific degree distribution, we show that the transformation which converts these graphs to their line (edge-dual) graphs produces an ensemble of graphs with nearly the same degree distribution, but with degree correlations and a much higher clustering coefficient. We also study the percolation properties of these new graphs.

  • Received 19 December 2002

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

©2003 American Physical Society

Authors & Affiliations

A. Ramezanpour* and V. Karimipour

  • Department of Physics, Sharif University of Technology, P.O. Box 11365-9161, Tehran, Iran

A. Mashaghi

  • Institute of Biophysics and Biochemistry, P.O. Box 13145-1384, Tehran, Iran

  • *Electronic address: ramzanpour@sharif.edu
  • Electronic address: vahid@sharif.edu
  • Electronic address: mashaghi@ibb.ut.ac.ir

References (Subscription Required)

Click to Expand
Issue

Vol. 67, Iss. 4 — April 2003

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
×