Generation of arbitrarily two-point correlated random networks
| dc.creator | Weber, Sebastian | |
| dc.creator | Porto, Markus | |
| dc.date | 2007-08-30 | |
| dc.date.accessioned | 2026-07-07T08:37:14Z | |
| dc.date.available | 2026-07-07T08:37:14Z | |
| dc.description | 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 correlated undirected random networks without self- 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 to fix an arbitrary degree distribution $P(k)$ and an arbitrary average nearest neighbor function $\knn(k)$ simultaneously. Using the presented algorithm, this formalism is demonstrated with scale-free networks ($P(k) \propto k^{-γ}$) 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. | |
| dc.description | 10 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/0708.4161 | |
| dc.identifier | http://arxiv.org/abs/0708.4161 | |
| dc.identifier | Phys. Rev. E 76, 046111 (2007) | |
| dc.identifier | doi:10.1103/PhysRevE.76.046111 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/140332 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Generation of arbitrarily two-point correlated random networks | |
| dc.type | text |