|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Constructionстатья
- Авторы: Tamm Mikhail V., Koval Dmitry G., Stadnichuk Vladimir I.
- Журнал: Physics
- Том: 3
- Номер: 4
- Год издания: 2021
- Издательство: American Physical Society
- Местоположение издательства: United States
- Первая страница: 998
- Последняя страница: 1014
- DOI: 10.3390/physics3040063
- Аннотация: Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties. This network is constructed by a deterministic procedure of consequentially splitting a triangle into smaller and smaller triangles. In this paper, a similar construction based on the consequential splitting of tetragons and other polygons with an even number of edges is presented. The suggested procedure is stochastic and results in the ensemble of planar scale-free graphs. In the limit of a large number of splittings, the degree distribution of the graph converges to a true power law with an exponent, which is smaller than three in the case of tetragons and larger than three for polygons with a larger number of edges. It is shown that it is possible to stochastically mix tetragon-based and hexagon-based constructions to obtain an ensemble of graphs with a tunable exponent of degree distribution. Other possible planar generalizations of the Apollonian procedure are also briefly discussed.
- Добавил в систему: Тамм Михаил Владимирович