Deterministic hierarchical networks
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/674
Tipus de documentArticle
Data publicació2006
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-SenseObraDerivada 2.5 Espanya
Abstract
It has recently been shown that many networks associated
with complex systems are small-world (they have both a large local clustering
and a small average distance and diameter) and they are also
scale-free (the degrees are distributed according to a power-law).
Moreover, these networks are very often hierarchical, as they describe the
modularity of the systems which are modeled.
While most of the studies for complex networks are based on
stochastic methods,
a deterministic approach, with an exact determination
of the main relevant parameters of the networks, has proven useful
to complement and enhance the probabilistic and simulation techniques and
therefore to provide a better understanding of the systems modeled.
In this paper we find the diameter, clustering and degree
distribution of a generic family of deterministic hierarchical small-world scale-free
networks which has been considered for modeling real life complex systems.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
BaCoDa06-networks.pdf | 152,5Kb | Visualitza/Obre |