title: Generating correlated networks from uncorrelated ones.
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.
authors.affiliation: Department of Physics, Sharif University of Technology, PO Box 11365-9161, Tehran, Iran. ramzanpour@sharif.edu
authors.forename: A
authors.initials: A
authors.lastname: Ramezanpour
authors.forename: V
authors.initials: V
authors.lastname: Karimipour
authors.forename: A
authors.initials: A
authors.lastname: Mashaghi