2006
DOI: 10.1007/s10955-006-9130-y
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Characterization of Complex Networks

Abstract: While the majority of approaches to the characterization of complex networks has relied on measurements considering only the immediate neighborhood of each network node, valuable information about the network topological properties can be obtained by considering further neighborhoods. The current work discusses on how the concepts of hierarchical node degree and hierarchical clustering coefficient (introduced in cond-mat/0408076), complemented by new hierarchical measurements, can be used in order to obtain a … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0
3

Year Published

2006
2006
2015
2015

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(29 citation statements)
references
References 36 publications
0
26
0
3
Order By: Relevance
“…Connectivity among neighbors of a node is quantified by the clustering coefficient cc , which reflects how many of all possible connections between neighbors actually exist (Watts and Strogatz, 1998; Kaiser et al, 2007a). The hierarchical clustering coefficient of level two cc 2 extends this concept to connections between neighbors’ neighbors (Costa and Silva, 2006). To what degree a node's neighbors connect to the same target is quantified by the locality index loc , which is based on the matching index (e.g., Kaiser and Hilgetag, 2004a).…”
Section: Methodsmentioning
confidence: 99%
“…Connectivity among neighbors of a node is quantified by the clustering coefficient cc , which reflects how many of all possible connections between neighbors actually exist (Watts and Strogatz, 1998; Kaiser et al, 2007a). The hierarchical clustering coefficient of level two cc 2 extends this concept to connections between neighbors’ neighbors (Costa and Silva, 2006). To what degree a node's neighbors connect to the same target is quantified by the locality index loc , which is based on the matching index (e.g., Kaiser and Hilgetag, 2004a).…”
Section: Methodsmentioning
confidence: 99%
“…This measurement, which is related to the heterogeneity of the vector p, provides a generalization of the classical concept of hierarchical (or concentric) degree [19], as explained in Fig. 1.…”
Section: The Effective Number Of Accessible Nodesmentioning
confidence: 99%
“…The current work addresses these problems through the concept of accessibility [18], which quantifies, for a given source node, the number of effectively accessible nodes at a given distance and with respect to a specific dynamics. In this sense, this measure complements the traditional hierarchical degree [19], providing valuable information about the network structure. Note that accessibility takes into account not only the number of nodes at a given distance, but also the transition probabilities between the source and these nodes.…”
Section: Introductionmentioning
confidence: 99%
“…2, 3, ...) from that specific node. 6 In particular, the hierarchical degree of a node for hierarchical level i corresponds to the number of edges connecting the nodes at distance i to the nodes at distance i + 1. The hierarchical clustering coefficient of a given node for hierarchical level i is calculated in the same way as the traditional clustering measurement, but considering the edges between the nodes at distance i and the nodes at distance i + 1.…”
Section: Hierarchical Measurementsmentioning
confidence: 99%