Towards a Better Understanding of the Characteristics of Fractal Networks

The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network is called fractal if the minimum number of boxes needed to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zakar-Polyák, Enikő, Nagy, Marcell, Molontay, Roland
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Zakar-Polyák, Enikő
Nagy, Marcell
Molontay, Roland
description The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network is called fractal if the minimum number of boxes needed to cover the entire network follows a power-law relation with the size of the boxes. The fractality of networks has been associated with various network properties throughout the years, for example, disassortativity, repulsion between hubs, long-range-repulsive correlation, and small edge betweenness centralities. However, these assertions are usually based on tailor-made network models and on a small number of real networks, hence their ubiquity is often disputed. Since fractal networks have been shown to have important properties, such as robustness against intentional attacks, it is in dire need to uncover the underlying mechanisms causing fractality. Hence, the main goal of this work is to get a better understanding of the origins of fractality in complex networks. To this end, we systematically review the previous results on the relationship between various network characteristics and fractality. Moreover, we perform a comprehensive analysis of these relations on five network models and a large number of real-world networks originating from six domains. We clarify which characteristics are universally present in fractal networks and which features are just artifacts or coincidences.
doi_str_mv 10.48550/arxiv.2212.03120
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2212_03120</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2212_03120</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-1503391ae24f0869069f20ce1b541327f6d220b8955ca0be5115309822ccc7d43</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woMIDMOEXSLi-jpN4hIhCpQqWMEc3_mmtlgTZFoW3hxSmTzqfdKTD2I2AsmqVgjuKX-GzRBRYghQIl2zTzyeKNnHiDy5nF_nbZF1MmSYbph2fPc97x7s9RTK_d0g5mLTg9QLoyF9cPs3xkK7Yhadjctf_u2L9-rHvnovt69Omu98WVDdQCAVSakEOKw9traHWHsE4MapKSGx8bRFhbLVShmB0SgglQbeIxpjGVnLFbv-055bhI4Z3it_D0jScm-QPhotFtQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Towards a Better Understanding of the Characteristics of Fractal Networks</title><source>arXiv.org</source><creator>Zakar-Polyák, Enikő ; Nagy, Marcell ; Molontay, Roland</creator><creatorcontrib>Zakar-Polyák, Enikő ; Nagy, Marcell ; Molontay, Roland</creatorcontrib><description>The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network is called fractal if the minimum number of boxes needed to cover the entire network follows a power-law relation with the size of the boxes. The fractality of networks has been associated with various network properties throughout the years, for example, disassortativity, repulsion between hubs, long-range-repulsive correlation, and small edge betweenness centralities. However, these assertions are usually based on tailor-made network models and on a small number of real networks, hence their ubiquity is often disputed. Since fractal networks have been shown to have important properties, such as robustness against intentional attacks, it is in dire need to uncover the underlying mechanisms causing fractality. Hence, the main goal of this work is to get a better understanding of the origins of fractality in complex networks. To this end, we systematically review the previous results on the relationship between various network characteristics and fractality. Moreover, we perform a comprehensive analysis of these relations on five network models and a large number of real-world networks originating from six domains. We clarify which characteristics are universally present in fractal networks and which features are just artifacts or coincidences.</description><identifier>DOI: 10.48550/arxiv.2212.03120</identifier><language>eng</language><subject>Computer Science - Discrete Mathematics ; Computer Science - Social and Information Networks ; Physics - Data Analysis, Statistics and Probability ; Physics - Physics and Society</subject><creationdate>2022-12</creationdate><rights>http://creativecommons.org/licenses/by/4.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,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2212.03120$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2212.03120$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zakar-Polyák, Enikő</creatorcontrib><creatorcontrib>Nagy, Marcell</creatorcontrib><creatorcontrib>Molontay, Roland</creatorcontrib><title>Towards a Better Understanding of the Characteristics of Fractal Networks</title><description>The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network is called fractal if the minimum number of boxes needed to cover the entire network follows a power-law relation with the size of the boxes. The fractality of networks has been associated with various network properties throughout the years, for example, disassortativity, repulsion between hubs, long-range-repulsive correlation, and small edge betweenness centralities. However, these assertions are usually based on tailor-made network models and on a small number of real networks, hence their ubiquity is often disputed. Since fractal networks have been shown to have important properties, such as robustness against intentional attacks, it is in dire need to uncover the underlying mechanisms causing fractality. Hence, the main goal of this work is to get a better understanding of the origins of fractality in complex networks. To this end, we systematically review the previous results on the relationship between various network characteristics and fractality. Moreover, we perform a comprehensive analysis of these relations on five network models and a large number of real-world networks originating from six domains. We clarify which characteristics are universally present in fractal networks and which features are just artifacts or coincidences.</description><subject>Computer Science - Discrete Mathematics</subject><subject>Computer Science - Social and Information Networks</subject><subject>Physics - Data Analysis, Statistics and Probability</subject><subject>Physics - Physics and Society</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woMIDMOEXSLi-jpN4hIhCpQqWMEc3_mmtlgTZFoW3hxSmTzqfdKTD2I2AsmqVgjuKX-GzRBRYghQIl2zTzyeKNnHiDy5nF_nbZF1MmSYbph2fPc97x7s9RTK_d0g5mLTg9QLoyF9cPs3xkK7Yhadjctf_u2L9-rHvnovt69Omu98WVDdQCAVSakEOKw9traHWHsE4MapKSGx8bRFhbLVShmB0SgglQbeIxpjGVnLFbv-055bhI4Z3it_D0jScm-QPhotFtQ</recordid><startdate>20221206</startdate><enddate>20221206</enddate><creator>Zakar-Polyák, Enikő</creator><creator>Nagy, Marcell</creator><creator>Molontay, Roland</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221206</creationdate><title>Towards a Better Understanding of the Characteristics of Fractal Networks</title><author>Zakar-Polyák, Enikő ; Nagy, Marcell ; Molontay, Roland</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-1503391ae24f0869069f20ce1b541327f6d220b8955ca0be5115309822ccc7d43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Discrete Mathematics</topic><topic>Computer Science - Social and Information Networks</topic><topic>Physics - Data Analysis, Statistics and Probability</topic><topic>Physics - Physics and Society</topic><toplevel>online_resources</toplevel><creatorcontrib>Zakar-Polyák, Enikő</creatorcontrib><creatorcontrib>Nagy, Marcell</creatorcontrib><creatorcontrib>Molontay, Roland</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zakar-Polyák, Enikő</au><au>Nagy, Marcell</au><au>Molontay, Roland</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Towards a Better Understanding of the Characteristics of Fractal Networks</atitle><date>2022-12-06</date><risdate>2022</risdate><abstract>The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network is called fractal if the minimum number of boxes needed to cover the entire network follows a power-law relation with the size of the boxes. The fractality of networks has been associated with various network properties throughout the years, for example, disassortativity, repulsion between hubs, long-range-repulsive correlation, and small edge betweenness centralities. However, these assertions are usually based on tailor-made network models and on a small number of real networks, hence their ubiquity is often disputed. Since fractal networks have been shown to have important properties, such as robustness against intentional attacks, it is in dire need to uncover the underlying mechanisms causing fractality. Hence, the main goal of this work is to get a better understanding of the origins of fractality in complex networks. To this end, we systematically review the previous results on the relationship between various network characteristics and fractality. Moreover, we perform a comprehensive analysis of these relations on five network models and a large number of real-world networks originating from six domains. We clarify which characteristics are universally present in fractal networks and which features are just artifacts or coincidences.</abstract><doi>10.48550/arxiv.2212.03120</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2212.03120
ispartof
issn
language eng
recordid cdi_arxiv_primary_2212_03120
source arXiv.org
subjects Computer Science - Discrete Mathematics
Computer Science - Social and Information Networks
Physics - Data Analysis, Statistics and Probability
Physics - Physics and Society
title Towards a Better Understanding of the Characteristics of Fractal Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-20T16%3A56%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Towards%20a%20Better%20Understanding%20of%20the%20Characteristics%20of%20Fractal%20Networks&rft.au=Zakar-Poly%C3%A1k,%20Enik%C5%91&rft.date=2022-12-06&rft_id=info:doi/10.48550/arxiv.2212.03120&rft_dat=%3Carxiv_GOX%3E2212_03120%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true