hierarchical network model
iterative algorithms for creating networks which are able to reproduce the unique properties of the scale-free topology and the high clustering of the nodes at the same time
≈ 2 min read
Names in other languages
- Englishhierarchical network model
- УкраїнськаІєрархічна мережева модель
- Românămodel de rețea ierarhică
- PortuguêsModelo rede hierárquica
- العربيةنموذج الشبكة الهرمية
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Hierarchical network models are iterative algorithms for creating networks which are able to reproduce the unique properties of the scale-free topology and the high clustering of the nodes at the same time. These characteristics are widely observed in nature, from biology to language to some social networks.
Hierarchical network models are usually derived in an iterative way by replicating the initial cluster of the network according to a certain rule. For instance, consider an initial network of five fully interconnected nodes (N=5). As a next step, create four replicas of this cluster and connect the peripheral nodes of each replica to the central node of the original cluster (N=25).
This step can be repeated indefinitely, thereby for any k steps the number of nodes in the system can be derived by N=5 k+1 . Of course there have been several different ways for creating hierarchical systems proposed in the literature.
These systems generally differ in the structure of the initial cluster as well as in the degree of expansion which is often referred to as the replication factor of the model. \gamma=1+\frac{\ln M}{\ln (M-1)} where M represents the replication factor of the model. Words can be regarded as network if one specifies the linkage criteria between them.
Defining links as appearance as a synonym in the Merriam-Webster dictionary a semantic web of 182,853 nodes with 317,658 edges was constructed. As it turned out, the obtained network of words indeed follows a power law in its degree distribution while the distribution of the clustering coefficient indicates that the underlying web follows a hierarchical structure with γ=3.25 and β=1.
By mapping the www.nd.edu domain a network of 325,729 nodes and 1,497,135 edges was obtained whose degree distribution followed a power law with γ out =2.45 and γ in =2.1 for the out- and in-degrees, respectively. The evidence for the scaling law distribution of the clustering coefficients is significantly weaker than in the previous cases although there is a clearly visible declining pattern in the distribution of C(k) indicating that the more links a domain has the less interconnected the linked/linking web pages are.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1314052987 under CC BY-SA 4.0; modifications have been made.