Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Deterministic hierarchical networks

Autor
Barriere, E.; Comellas, F.; Dalfo, C.; Fiol, M.
Tipus d'activitat
Article en revista
Revista
Journal of physics A. Mathematical and theoretical
Data de publicació
2016
Volum
49
Número
22
Pàgina inicial
1
Pàgina final
19
DOI
https://doi.org/10.1088/1751-8113/49/22/225202 Obrir en finestra nova
Projecte finançador
Tecnicas de optimizacion en teoria de grafos, grupos y combinatoria. aplicaciones a redes, algoritmos y protocolos de comunicacion.
Repositori
http://hdl.handle.net/2117/89918 Obrir en finestra nova
Resum
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and 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 that are modeled. Most of the studies for complex networks are based on stochastic methods. However, a deterministic method, with an exact determination of the mai...
Citació
Barriere, E., Comellas, F., Dalfo, C., Fiol, M. Deterministic hierarchical networks. "Journal of physics A. Mathematical and theoretical", 2016, vol. 49, núm. 22, p. 1-19.
Paraules clau
Hierarchical Network, Small-world, Scale-free, Degree, Diameter, Clustering
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions