| Autor: |
Matej Babič, Dragan Marinković, Miha Kovačič, Branko Šter, Michele Calì |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Fractal and Fractional, Vol 6, Iss 6, p 282 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
2504-3110 |
| DOI: |
10.3390/fractalfract6060282 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
