The generation of random directed networks with prescribed 1-node and 2-node degree correlations

Gorka Zamora-Lopez, Changsong Zhou, Vinko Zlatic, Juergen Kurths

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

Original languageEnglish
Article number224006
Number of pages15
JournalJournal of Physics. A, Mathematical and theoretical
Volume41
Issue number22
Early online date21 May 2008
DOIs
Publication statusPublished - 6 Jun 2008

Cite this

The generation of random directed networks with prescribed 1-node and 2-node degree correlations. / Zamora-Lopez, Gorka; Zhou, Changsong; Zlatic, Vinko; Kurths, Juergen.

In: Journal of Physics. A, Mathematical and theoretical, Vol. 41, No. 22, 224006, 06.06.2008.

Research output: Contribution to journalArticle

Zamora-Lopez, Gorka ; Zhou, Changsong ; Zlatic, Vinko ; Kurths, Juergen. / The generation of random directed networks with prescribed 1-node and 2-node degree correlations. In: Journal of Physics. A, Mathematical and theoretical. 2008 ; Vol. 41, No. 22.
@article{c69f719e6b08484cb159a5ee00863ddf,
title = "The generation of random directed networks with prescribed 1-node and 2-node degree correlations",
abstract = "The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.",
author = "Gorka Zamora-Lopez and Changsong Zhou and Vinko Zlatic and Juergen Kurths",
year = "2008",
month = "6",
day = "6",
doi = "10.1088/1751-8113/41/22/224006",
language = "English",
volume = "41",
journal = "Journal of Physics. A, Mathematical and theoretical",
issn = "1751-8113",
publisher = "IOP Publishing Ltd.",
number = "22",

}

TY - JOUR

T1 - The generation of random directed networks with prescribed 1-node and 2-node degree correlations

AU - Zamora-Lopez, Gorka

AU - Zhou, Changsong

AU - Zlatic, Vinko

AU - Kurths, Juergen

PY - 2008/6/6

Y1 - 2008/6/6

N2 - The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

AB - The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

U2 - 10.1088/1751-8113/41/22/224006

DO - 10.1088/1751-8113/41/22/224006

M3 - Article

VL - 41

JO - Journal of Physics. A, Mathematical and theoretical

JF - Journal of Physics. A, Mathematical and theoretical

SN - 1751-8113

IS - 22

M1 - 224006

ER -