Loading...
Loading...

Go to the content (press return)

Deterministic hierarchical networks

Author
Barriere, E.; Comellas, F.; Dalfo, C.; Fiol, M.
Type of activity
Journal article
Journal
Journal of physics A. Mathematical and theoretical
Date of publication
2016
Volume
49
Number
22
First page
1
Last page
19
DOI
https://doi.org/10.1088/1751-8113/49/22/225202 Open in new window
Project funding
Tecnicas de optimizacion en teoria de grafos, grupos y combinatoria. aplicaciones a redes, algoritmos y protocolos de comunicacion.
Repository
http://hdl.handle.net/2117/89918 Open in new window
Abstract
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...
Citation
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.
Keywords
clustering, degree, diameter, hierarchical network, scale-free, small-world
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Attachments