A New Method of Quantifying the Complexity of Fractal Networks
There is a large body of research devoted to identifying the complexity of structures in networks. In the context of network theory, a complex network is a graph with nontrivial topological features—features that do not occur in simple networks, such as lattices or random graphs, but often occur in...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-05-01
|
| Series: | Fractal and Fractional |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-3110/6/6/282 |
| _version_ | 1797487380669661184 |
|---|---|
| author | Matej Babič Dragan Marinković Miha Kovačič Branko Šter Michele Calì |
| author_facet | Matej Babič Dragan Marinković Miha Kovačič Branko Šter Michele Calì |
| author_sort | Matej Babič |
| collection | DOAJ |
| description | There is a large body of research devoted to identifying the complexity of structures in networks. In the context of network theory, a complex network is a graph with nontrivial topological features—features that do not occur in simple networks, such as lattices or random graphs, but often occur in graphs modeling real systems. The study of complex networks is a young and active area of scientific research inspired largely by the empirical study of real-world networks, such as computer networks and logistic transport networks. Transport is of great importance for the economic and cultural cooperation of any country with other countries, the strengthening and development of the economic management system, and in solving social and economic problems. Provision of the territory with a well-developed transport system is one of the factors for attracting population and production, serving as an important advantage for locating productive forces and providing an integration effect. In this paper, we introduce a new method for quantifying the complexity of a network based on presenting the nodes of the network in Cartesian coordinates, converting to polar coordinates, and calculating the fractal dimension using the ReScaled ranged (R/S) method. Our results suggest that this approach can be used to determine complexity for any type of network that has fixed nodes, and it presents an application of this method in the public transport system. |
| first_indexed | 2024-03-09T23:46:50Z |
| format | Article |
| id | doaj.art-82fb523f58004311aa180b06aa104bd0 |
| institution | Directory Open Access Journal |
| issn | 2504-3110 |
| language | English |
| last_indexed | 2024-03-09T23:46:50Z |
| publishDate | 2022-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Fractal and Fractional |
| spelling | doaj.art-82fb523f58004311aa180b06aa104bd02023-11-23T16:42:06ZengMDPI AGFractal and Fractional2504-31102022-05-016628210.3390/fractalfract6060282A New Method of Quantifying the Complexity of Fractal NetworksMatej Babič0Dragan Marinković1Miha Kovačič2Branko Šter3Michele Calì4Faculty of Information Studies, 8000 Novo Mesto, SloveniaDepartment of Structural Mechanics and Analysis, Technical University Berlin, 10623 Berlin, GermanyŠtore Steel Ltd., Železarska cesta 3, 3220 Štore, SloveniaFaculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, SloveniaDepartment of Electric, Electronics and Computer Engineering, University of Catania, 95125 Catania, ItalyThere is a large body of research devoted to identifying the complexity of structures in networks. In the context of network theory, a complex network is a graph with nontrivial topological features—features that do not occur in simple networks, such as lattices or random graphs, but often occur in graphs modeling real systems. The study of complex networks is a young and active area of scientific research inspired largely by the empirical study of real-world networks, such as computer networks and logistic transport networks. Transport is of great importance for the economic and cultural cooperation of any country with other countries, the strengthening and development of the economic management system, and in solving social and economic problems. Provision of the territory with a well-developed transport system is one of the factors for attracting population and production, serving as an important advantage for locating productive forces and providing an integration effect. In this paper, we introduce a new method for quantifying the complexity of a network based on presenting the nodes of the network in Cartesian coordinates, converting to polar coordinates, and calculating the fractal dimension using the ReScaled ranged (R/S) method. Our results suggest that this approach can be used to determine complexity for any type of network that has fixed nodes, and it presents an application of this method in the public transport system.https://www.mdpi.com/2504-3110/6/6/282fractalnetworkcomplexityHurst exponent Hpublic transport |
| spellingShingle | Matej Babič Dragan Marinković Miha Kovačič Branko Šter Michele Calì A New Method of Quantifying the Complexity of Fractal Networks Fractal and Fractional fractal network complexity Hurst exponent H public transport |
| title | A New Method of Quantifying the Complexity of Fractal Networks |
| title_full | A New Method of Quantifying the Complexity of Fractal Networks |
| title_fullStr | A New Method of Quantifying the Complexity of Fractal Networks |
| title_full_unstemmed | A New Method of Quantifying the Complexity of Fractal Networks |
| title_short | A New Method of Quantifying the Complexity of Fractal Networks |
| title_sort | new method of quantifying the complexity of fractal networks |
| topic | fractal network complexity Hurst exponent H public transport |
| url | https://www.mdpi.com/2504-3110/6/6/282 |
| work_keys_str_mv | AT matejbabic anewmethodofquantifyingthecomplexityoffractalnetworks AT draganmarinkovic anewmethodofquantifyingthecomplexityoffractalnetworks AT mihakovacic anewmethodofquantifyingthecomplexityoffractalnetworks AT brankoster anewmethodofquantifyingthecomplexityoffractalnetworks AT michelecali anewmethodofquantifyingthecomplexityoffractalnetworks AT matejbabic newmethodofquantifyingthecomplexityoffractalnetworks AT draganmarinkovic newmethodofquantifyingthecomplexityoffractalnetworks AT mihakovacic newmethodofquantifyingthecomplexityoffractalnetworks AT brankoster newmethodofquantifyingthecomplexityoffractalnetworks AT michelecali newmethodofquantifyingthecomplexityoffractalnetworks |