Source:http://linkedlifedata.com/resource/pubmed/id/17995064
Switch to
Predicate | Object |
---|---|
rdf:type | |
lifeskim:mentions | |
pubmed:issue |
4 Pt 2
|
pubmed:dateCreated |
2007-11-12
|
pubmed:abstractText |
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 k_{nn}(k) simultaneously. Using the presented algorithm, this formalism is demonstrated with scale-free networks [P(k) proportional, variantk;{-gamma}] 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.
|
pubmed:language |
eng
|
pubmed:journal | |
pubmed:status |
PubMed-not-MEDLINE
|
pubmed:month |
Oct
|
pubmed:issn |
1539-3755
|
pubmed:author | |
pubmed:issnType |
Print
|
pubmed:volume |
76
|
pubmed:owner |
NLM
|
pubmed:authorsComplete |
Y
|
pubmed:pagination |
046111
|
pubmed:year |
2007
|
pubmed:articleTitle |
Generation of arbitrarily two-point-correlated random networks.
|
pubmed:affiliation |
Institut für Festkörperphysik, Technische Universität Darmstadt, Hochschulstrasse 8, 64289 Darmstadt, Germany.
|
pubmed:publicationType |
Journal Article
|