|
In terms of graph theory we may say, that the extended graph ![]() . Figure 6 shows two local subgraphs namely the stars of the nodes and , while figure 7 (upper part) displays the extended graph without edge labels. NB: This graph is not drawable on a torus without edge crossings.
On other region pairs the metric is defined in terms of indirect kinship. To each sequence one can attribute its length and defines ![]()
The lower part of Figure 7 displays the distances 5.3 Hybrid Space: Hierarchy versus Shortest PathHow to combine the intra-regional and the inter-regional distances? A solution is to just identify the regional loci in Weber Space with the corresponding regional centers in the disjoint union of all 24 regional spaces: ![]() we write for the corresponding region and for its center. The intra-regional distances together with the inter-regional distance partially define a metric which can be canonically extended to a metric . Consider two loci in different regions. Their strict distance is then
|