Identification of intrinsic long-range degree correlations in complex networks
Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2020-01 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Fujiki, Yuka Yakubo, Kousuke |
| description | Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest path distance between them. While LRDCs are induced by nearest-neighbor degree correlations (NNDCs) between adjacent nodes, some networks possess intrinsic LRDCs which cannot be generated by NNDCs. Here we develop a method to extract intrinsic LRDC in a correlated network by comparing the probability distributions for the given network with those for nearest-neighbor correlated random networks. We also demonstrate the utility of our method by applying it to several real-world networks. |
| doi_str_mv | 10.48550/arxiv.1904.10148 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1904_10148</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2213627011</sourcerecordid><originalsourceid>FETCH-LOGICAL-a521-1dce2a06e0884a3c314b48ecdf08b9c1a2c340cf2e7d53237e54036a0a2e4eb03</originalsourceid><addsrcrecordid>eNotj11LwzAYhYMgOOZ-gFcWvO588yZps0sZfgyG3uy-pOnbktklM-l0_nu7zavDgYfDeRi74zCXWil4NPHovud8AXLOgUt9xSYoBM-1RLxhs5S2AIBFiUqJCXtfNeQH1zprBhd8FtrM-SE6n5zN-uC7PBrfUdZQF4kyG2Kk_oymERz7bt_TMfM0_IT4mW7ZdWv6RLP_nLLNy_Nm-ZavP15Xy6d1bhTynDeW0EBBoLU0wgoua6nJNi3oemG5QSsk2BapbJRAUZKSIAoDBklSDWLK7i-zZ9lqH93OxN_qJF2dpUfi4ULsY_g6UBqqbThEP36qELkosATOxR9hfFrb</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2213627011</pqid></control><display><type>article</type><title>Identification of intrinsic long-range degree correlations in complex networks</title><source>Freely Accessible Journals</source><source>arXiv.org</source><creator>Fujiki, Yuka ; Yakubo, Kousuke</creator><creatorcontrib>Fujiki, Yuka ; Yakubo, Kousuke</creatorcontrib><description>Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest path distance between them. While LRDCs are induced by nearest-neighbor degree correlations (NNDCs) between adjacent nodes, some networks possess intrinsic LRDCs which cannot be generated by NNDCs. Here we develop a method to extract intrinsic LRDC in a correlated network by comparing the probability distributions for the given network with those for nearest-neighbor correlated random networks. We also demonstrate the utility of our method by applying it to several real-world networks.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1904.10148</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Social and Information Networks ; Conditional probability ; Correlation ; Networks ; Nodes ; Physics - Physics and Society ; Shortest-path problems</subject><ispartof>arXiv.org, 2020-01</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,785,886,27930</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1904.10148$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1103/PhysRevE.101.032308$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Fujiki, Yuka</creatorcontrib><creatorcontrib>Yakubo, Kousuke</creatorcontrib><title>Identification of intrinsic long-range degree correlations in complex networks</title><title>arXiv.org</title><description>Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest path distance between them. While LRDCs are induced by nearest-neighbor degree correlations (NNDCs) between adjacent nodes, some networks possess intrinsic LRDCs which cannot be generated by NNDCs. Here we develop a method to extract intrinsic LRDC in a correlated network by comparing the probability distributions for the given network with those for nearest-neighbor correlated random networks. We also demonstrate the utility of our method by applying it to several real-world networks.</description><subject>Computer Science - Social and Information Networks</subject><subject>Conditional probability</subject><subject>Correlation</subject><subject>Networks</subject><subject>Nodes</subject><subject>Physics - Physics and Society</subject><subject>Shortest-path problems</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj11LwzAYhYMgOOZ-gFcWvO588yZps0sZfgyG3uy-pOnbktklM-l0_nu7zavDgYfDeRi74zCXWil4NPHovud8AXLOgUt9xSYoBM-1RLxhs5S2AIBFiUqJCXtfNeQH1zprBhd8FtrM-SE6n5zN-uC7PBrfUdZQF4kyG2Kk_oymERz7bt_TMfM0_IT4mW7ZdWv6RLP_nLLNy_Nm-ZavP15Xy6d1bhTynDeW0EBBoLU0wgoua6nJNi3oemG5QSsk2BapbJRAUZKSIAoDBklSDWLK7i-zZ9lqH93OxN_qJF2dpUfi4ULsY_g6UBqqbThEP36qELkosATOxR9hfFrb</recordid><startdate>20200130</startdate><enddate>20200130</enddate><creator>Fujiki, Yuka</creator><creator>Yakubo, Kousuke</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200130</creationdate><title>Identification of intrinsic long-range degree correlations in complex networks</title><author>Fujiki, Yuka ; Yakubo, Kousuke</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a521-1dce2a06e0884a3c314b48ecdf08b9c1a2c340cf2e7d53237e54036a0a2e4eb03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Social and Information Networks</topic><topic>Conditional probability</topic><topic>Correlation</topic><topic>Networks</topic><topic>Nodes</topic><topic>Physics - Physics and Society</topic><topic>Shortest-path problems</topic><toplevel>online_resources</toplevel><creatorcontrib>Fujiki, Yuka</creatorcontrib><creatorcontrib>Yakubo, Kousuke</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fujiki, Yuka</au><au>Yakubo, Kousuke</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Identification of intrinsic long-range degree correlations in complex networks</atitle><jtitle>arXiv.org</jtitle><date>2020-01-30</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest path distance between them. While LRDCs are induced by nearest-neighbor degree correlations (NNDCs) between adjacent nodes, some networks possess intrinsic LRDCs which cannot be generated by NNDCs. Here we develop a method to extract intrinsic LRDC in a correlated network by comparing the probability distributions for the given network with those for nearest-neighbor correlated random networks. We also demonstrate the utility of our method by applying it to several real-world networks.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1904.10148</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2020-01 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1904_10148 |
| source | Freely Accessible Journals; arXiv.org |
| subjects | Computer Science - Social and Information Networks Conditional probability Correlation Networks Nodes Physics - Physics and Society Shortest-path problems |
| title | Identification of intrinsic long-range degree correlations in complex networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T23%3A07%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Identification%20of%20intrinsic%20long-range%20degree%20correlations%20in%20complex%20networks&rft.jtitle=arXiv.org&rft.au=Fujiki,%20Yuka&rft.date=2020-01-30&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1904.10148&rft_dat=%3Cproquest_arxiv%3E2213627011%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2213627011&rft_id=info:pmid/&rfr_iscdi=true |