Link-space formalism for network analysis.
We introduce the link-space formalism for analyzing network models with degree-degree correlations. The formalism is based on a statistical description of the fraction of links l(i,j) connecting nodes of degrees i and j. To demonstrate its use, we apply the framework to some pedagogical network mode...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2008
|
| _version_ | 1797075557579489280 |
|---|---|
| author | Smith, D Lee, C Onnela, J Johnson, N |
| author_facet | Smith, D Lee, C Onnela, J Johnson, N |
| author_sort | Smith, D |
| collection | OXFORD |
| description | We introduce the link-space formalism for analyzing network models with degree-degree correlations. The formalism is based on a statistical description of the fraction of links l(i,j) connecting nodes of degrees i and j. To demonstrate its use, we apply the framework to some pedagogical network models, namely, random attachment, Barabási-Albert preferential attachment, and the classical Erdos and Rényi random graph. For these three models the link-space matrix can be solved analytically. We apply the formalism to a simple one-parameter growing network model whose numerical solution exemplifies the effect of degree-degree correlations for the resulting degree distribution. We also employ the formalism to derive the degree distributions of two very simple network decay models, more specifically, that of random link deletion and random node deletion. The formalism allows detailed analysis of the correlations within networks and we also employ it to derive the form of a perfectly nonassortative network for arbitrary degree distribution. |
| first_indexed | 2024-03-06T23:52:00Z |
| format | Journal article |
| id | oxford-uuid:72ebb0e2-478e-4f52-ac91-3ea3dfc8776d |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T23:52:00Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | oxford-uuid:72ebb0e2-478e-4f52-ac91-3ea3dfc8776d2022-03-26T19:53:09ZLink-space formalism for network analysis.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:72ebb0e2-478e-4f52-ac91-3ea3dfc8776dEnglishSymplectic Elements at Oxford2008Smith, DLee, COnnela, JJohnson, NWe introduce the link-space formalism for analyzing network models with degree-degree correlations. The formalism is based on a statistical description of the fraction of links l(i,j) connecting nodes of degrees i and j. To demonstrate its use, we apply the framework to some pedagogical network models, namely, random attachment, Barabási-Albert preferential attachment, and the classical Erdos and Rényi random graph. For these three models the link-space matrix can be solved analytically. We apply the formalism to a simple one-parameter growing network model whose numerical solution exemplifies the effect of degree-degree correlations for the resulting degree distribution. We also employ the formalism to derive the degree distributions of two very simple network decay models, more specifically, that of random link deletion and random node deletion. The formalism allows detailed analysis of the correlations within networks and we also employ it to derive the form of a perfectly nonassortative network for arbitrary degree distribution. |
| spellingShingle | Smith, D Lee, C Onnela, J Johnson, N Link-space formalism for network analysis. |
| title | Link-space formalism for network analysis. |
| title_full | Link-space formalism for network analysis. |
| title_fullStr | Link-space formalism for network analysis. |
| title_full_unstemmed | Link-space formalism for network analysis. |
| title_short | Link-space formalism for network analysis. |
| title_sort | link space formalism for network analysis |
| work_keys_str_mv | AT smithd linkspaceformalismfornetworkanalysis AT leec linkspaceformalismfornetworkanalysis AT onnelaj linkspaceformalismfornetworkanalysis AT johnsonn linkspaceformalismfornetworkanalysis |