Generating correlated networks from uncorrelated ones

Preprint

19 December 2002

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0212469

Abstract

In this paper we consider a transformation which converts uncorrelated networks to correlated ones(here by correlation we mean that coordination numbers of two neighbors are not independent). We show that this transformation, which converts edges to nodes and connects them according to a deterministic rule, nearly preserves the degree distribution of the network and significantly increases the clustering coefficient. This transformation also enables us to relate percolation properties of the two networks.

Keywords

NETWORKS TO CORRELATED
PERCOLATION PROPERTIES
UNCORRELATED NETWORKS
GENERATING CORRELATED
COORDINATION NUMBERS
DEGREE DISTRIBUTION
RELATE PERCOLATION
TWO NEIGHBORS
CONVERTS

All Related Versions

Version 1, 2002-12-19, ArXiv
Published version: Physical Review E, 67 (4), 046107.

This publication has 0 references indexed in Scilit: