# Embedding the intrinsic relevance of vertices in network analysis: the case of centrality metrics

## Abstract

Complex network theory (CNT) is gaining a lot of attention in the scientific community, due to its capability to model and interpret an impressive number of natural and anthropic phenomena. One of the most active CNT field concerns the evaluation of the centrality of vertices and edges in the network. Several metrics have been proposed, but all of them share a topological point of view, namely centrality descends from the local or global connectivity structure of the network. However, vertices can exhibit their own intrinsic relevance independent from topology; e.g., vertices representing strategic locations (e.g., hospitals, water and energy sources, etc.) or institutional roles (e.g., presidents, agencies, etc.). In these cases, the connectivity network structure and vertex intrinsic relevance mutually concur to define the centrality of vertices and edges. The purpose of this work is to embed the information about the intrinsic relevance of vertices into CNT tools to enhance the network analysis. We focus on the degree, closeness and betweenness metrics, being among the most used. Two examples, concerning a social (the historical Florence family’s marriage network) and an infrastructure (a water supply system) network, demonstrate the effectiveness of the proposed relevance-embedding extension of the centrality metrics.

## Introduction

Complex network theory (CNT) is today one the most active research fields allowing to analyze and predict the behavior of a wide variety of complex systems. CNT is becoming an emerging paradigm to study an impressive number of networked systems, ranging from physics to social sciences, from  biology to infrastructure engineering. In this line, the growing computational power and data availability are giving a crucial contribution to the rapid growth of CNT tools for the network classification1,2 community detection3,4, vertex and edge centrality assessment2, vulnerability5, spatial and temporal evolution6, etc.

The evaluation of the centrality and the corresponding ranking have always been a key aspect in the network analysis. Freeman7 proposed the first comprehensive study of the topological centrality, by identifying three main factors: (i) the degree as capability to spread information because of the number of local connections, (ii) the position in the network as importance of the vertices for the global exchange of information into the entire system, and (iii) the connections which identify preferential shortest paths into the network. Since then, centrality problem has attracted a lot of attention and many centrality metrics have been proposed2; examples are the Katz centrality8, the betweenness centrality7, the closeness centrality7, the eigenvector centrality9, the PageRank10, and the so-called Hub and Authorities11.

A fundamental characteristic of the efforts made to define and refine the centrality is that the concept of centrality has always been generally interpreted from a topological point of view, i.e. considering the position and connectivity of vertices and edges in the network, and not investigating the possible existence of an intrinsic vertex relevance independent from topology. This topology-based approach to the centrality problem is understandable as the identification of the centrality starting from the network connectivity structure is a considerable conceptual challenge. Nevertheless, the experience on networked systems shows that topology does not contain all the information, because the vertices can be characterized by a different intrinsic relevance that needs be considered. For example, in the social communities some people can act as influencer because of their activity in social media (i.e., influencer considering Instagram or Facebook), but others are influencers because of their reputation or representative institutional position (e.g., university rectors, presidents, prime ministers, etc.) in spite of their lower activity in social media. In the corresponding social networks, the first class of influencers is characterized by high degree of connections and their high topology-based centrality is correctly detected by classical CNT tools. The second class of influencers exhibits instead a lower degree of connections and standard CNT tools could not correctly quantify their actual centrality in the network. Infrastructure networks (e.g., water and energy distribution networks) are another example of the importance to consider the intrinsic relevance of vertices. In these cases, some strategic vertices, e.g., energy/water sources, hospitals, schools, administrative buildings, are characterized by a relevance independent from their topological position and connectivity; the intrinsic relevance needs to be embedded in the centrality evaluation to make useful CNT for such networked systems. We can state the identical intrinsic relevance of vertices is an inherent assumption CNT tools and that such assumption can hide a part of the network information, not allowing an effective analysis when vertices exhibit the heterogeneous intrinsic relevance.

The importance of relaxing the assumption of identical intrinsic relevance of vertices is demonstrated in this work focusing on three classical centrality metrics: the degree, the closeness, and the betweenness2,7. We here used the harmonic version of the closeness because it works for unconnected graphs12.

We extend the standard definitions of these three metrics to embed the intrinsic relevance of vertices, showing that this information can increase the capability of centrality tools to assess the relevance of vertices and edges. The finding is that not considering the information about the intrinsic relevance of vertices can give misleading outcomes for some networked systems.

Actually, some researchers proposed to assign weights to vertices to analyse networks13,14,15,16,17. Nevertheless, they focused on the assessment of vertices weight, dealing with the degree. Instead, Agryzkov et al.18 proposed a modified Adapted PageRank Algorithm and Agryzkov et al.19 modified the eigenvector centrality to establish a ranking of vertices in urban networks, embedding data about the presence of facilities (bars, coffees, restaurants, etc.) in the network topology. Both works, however, did not consider the metrics based on shortest paths and, therefore, the interaction between vertices. Differently, we here propose and discuss the importance of the vertices (i.e. their intrinsic relevance), by highlighting its different role with respect to the usual edges weight used to identify shortest paths. Then, we embed the intrinsic relevance of vertices in the shortest path-based centrality metrics, and in the degree centrality.

The work is organized as follows. The next section recalls the standard definitions of degree, (harmonic) closeness, and betweenness metrics and proposes the embedding of the intrinsic relevance of vertices in the standard formulations. Subsequently, the formulation of the intrinsic relevance is proposed and discussed. In the third section, the novel relevance-embedding centralities are applied to the historical Florence family’s marriage network. Afterward, the novel extended betweenness is applied to an infrastructural (water supply) networked system. The last section reports the concluding remarks.

## Embedding Vertex Intrinsic Relevance to Degree, Harmonic and Betweenness Centrality

### Degree centrality

We consider a network N composed of V vertices and E edges. The degree d(s) of a vertex s is

$$d(s)=\sum _{t}{A}_{st}\,t=1\ldots V$$
(1)

where Ast is the adjacency matrix of the network. The standard degree of Eq. (1) assumes that all vertices are characterized by an identical intrinsic relevance. Such centrality informs on the vertex influence on its neighbours and, consequently, the metric exclusively depends on the (local) connectivity structure. We here relax the identical relevance assumption and undertake that each vertex has its own intrinsic relevance, Rv (v = 1, …, V). Furthermore, we introduce the function f(Rs, Rt) that depends on the relevance of vertices s and t. It weights the importance of the connection of the vertex s with its neighbors. Hence, the definition of the degree can be extended to embed the information about the vertex intrinsic relevance as follows,

$$d(s)=\sum _{t}{A}_{st}f({R}_{s},\,{R}_{t})\,t=1\ldots V$$
(2)

To show the consequences of Eq. (2), we consider a pure regular network composed of four vertices and four edges as reported in Fig. 1. We assume that the function f is an increasing monotonic function and that f(1, 1) = 1 holds; in particular, in the present exercise we consider f(Rs, Rt) = Rs·Rt.

In the standard condition (RA = RB = RC = RD = 1) Eq. (2) provides, as well as Eq. (1), the degree equal to two for each vertex of the regular network. We here double the relevance of A (RA = 2) maintaining RB = RC = RD = 1. The degree becomes: dA = 4, dB = 3, dC = 2 and dD = 3. Therefore, increasing the intrinsic relevance of the vertex A increases its relevance-embedding degree and that of the adjacent vertices B and D. It follows that embedding the intrinsic relevance in the degree allows to account for the vertex relevance together with the connectivity structure of the network, generating hubs. In the specific case, the regular network becomes more and more scale free.

### Harmonic centrality

The harmonic version of the closeness C(s) centrality of a generic vertex s is

$$C(s)=\sum _{t}\frac{1}{dis{t}_{s,t}}\,t=1\ldots V$$
(3)

where dists,t is the shortest distance between vertices s and t. Also, the standard harmonic centrality assumes that all the vertices are characterized by an identical intrinsic relevance. Therefore, the values C(s) exclusively depend on the connectivity structure of the network and, for weighted networks, on the edge weights driving the identification of the shortest paths and distance dists,t. The harmonic centrality informs on vertex capacity to spread information through the network or to contact easily the other vertices of the network.

We embed the vertex intrinsic relevance for the harmonic version of the closeness centrality as,

$$C(s)=\sum _{t}\frac{f({R}_{s},{R}_{t})}{dis{t}_{s,t}}\,t=1\ldots V$$
(4)

To exemplify the impact of the vertex intrinsic relevance, we consider the same network and function f(Rs, Rt) of the degree case. We also assume the edge weights, wA-B = 0.5 and wB-C = wC-D = wD-A = 1, to explain the different role of edge weights with respect to the vertex intrinsic relevance, as reported in Fig. 2.

The standard assumption (i.e., RA = RB = RC = RD = 1) provides CA = CB = 3.66 and CC = CD = 2.66. In fact, the vertices A and B are characterized by a greater capacity to spread the information with respect to C and D because wA-B is lower than the other weights. Therefore, the connectivity structure of the network and the edge weights, determining the selection of the shortest path and the distance value between couples of vertices, characterize the vertex capacity to spread information. Notice that in the case of same edge weights, the harmonic centrality results CA = CB = CC = CD because the network is regular also with respect to edge weights.

Similarly, to the degree case, we relax the assumption of identical relevance doubling RA (=2) and maintaining unitary the others (RB = RC = RD = 1). Equation (4), made explicit in Fig. 2 for the simple regular network, provides CA = 7.33, CB = 5.66, CC = 3.33 and CD = 3.66. Therefore, the intrinsic relevance of A increases its capacity to spread the information (i.e., the value of the harmonic centrality) and that of the nearest (as distance d) vertices.

This simple example shows how the intrinsic relevance concurs, together with the connectivity structure and edge weights (in the case of weighted networks), in increasing the capacity to spread information of the most relevant vertices and of the nearest ones.

### Betweenness centrality

The standard betweenness assigns the number of shortest paths traversing a vertex v for all the couples of vertices s and t of the network. Mathematically, it reads

$$B(v)=\sum _{s\ne v\ne t\in N}\frac{{\sigma }_{s,t}(v)}{{\sigma }_{s,t}}\,$$
(5)

where B(v) is the betweenness of the vertex v, while σs,t(v) and σs,t are the number of shortest paths traversing the vertex v and the total number of all shortest paths, respectively, for the each couple of vertices s and t. Actually, more than one shortest path might exist for a couple of vertices s and t; σs,t accounts for this occurrence.

Similarly, the edge betweenness, EB(e), is the sum of the fractions for all the couples of vertices s and t of the network traversing an edge e. The formulation is

$$EB(e)=\sum _{s\ne t\in N}\frac{{\sigma }_{s,t}(e)}{{\sigma }_{s,t}}\,$$
(6)

where σs,t(e) is the number of shortest paths traversing the edge e for all the couples of vertices s and t of the network.

Notice that, in the previous definitions (5 and 6), the fraction vanishes in the case of weighted networks. In fact, a single shortest path generally exists between each couple s and t in weighted networks; the vertex and edge betweenness formulations become, respectively,

$$\begin{array}{c}B(v)=\sum _{s\ne v\ne t\in N}\delta (v\in {S}_{s,t})\,\\ EB(e)=\sum _{s\ne t\in N}\delta (e\in {S}_{s,t})\,\end{array}$$
(7)

where the Kronecker’s δ function value is unitary if the vertices v (or the edge e) is member of the shortest path Ss,t and zero otherwise.

The betweenness informs in which elements of the network (vertices or edges) the information is more likely to pass.

We report in Fig. 3 the way the standard betweenness is computed to illustrate the proposal of embedding the vertex intrinsic relevance. As shown in Fig. 3(a), given the shortest path between two generic vertices s and t, the betweenness of each traversed vertex (or edge, in the case of edge betweenness) has a unitary increment. After the identification of all the shortest paths between all the couples s and t, the betweenness assigns to each vertex (edge) the number of times has been traversed. Therefore, the values of the betweenness depend on the network connectivity structure and the presence of edge weights, which determine the shortest paths between couples of vertices.

We here propose to weight by f (Rs, Rt) the shortest paths between s and t. I.e., we assume that its importance depends on the relevance of the two path-ending vertices s and t. Consequently, the betweenness of each element (vertex or edge) traversed by the path increases of a quantity f(Rs, Rt). Figure 3(b) exemplifies the proposed assignment to internal elements of a shortest path.

Accordingly, the formulation of the betweenness embedding the intrinsic relevance becomes

$$\begin{array}{c}B(v)=\sum _{s\ne v\ne t\in N}f({R}_{s},{R}_{t})\delta (v\in {S}_{s,t})\,\\ EB(e)=\sum _{s\ne t\in N}f({R}_{s},{R}_{t})\delta (e\in {S}_{s,t})\,\end{array}$$
(8)

or, considering the most general case of Eqs. (5 and 6),

$$\begin{array}{c}B(v)=\sum _{s\ne v\ne t\in N}f({R}_{s},{R}_{t})\frac{{\sigma }_{s,t}(v)}{{\sigma }_{s,t}}\,\\ EB(e)=\sum _{s\ne t\in N}f({R}_{s},{R}_{t})\frac{{\sigma }_{s,t}(e)}{{\sigma }_{s,t}}\,\end{array}$$
(9)

To show the consequences of embedding the vertex intrinsic relevance, we use the same simple unweighted network of Fig. 1. Figure 4 reports the shortest paths and the formulae to compute the betweenness and the edge betweenness. Notice that, for example, two paths exist from A and C and the factor ½ (σA,C = 2) accounts for that occurrence.

We perform the standard assumption RA = RB = RC = RD = 1, obtaining BA = BB = BC = BD = 1 and EBA-B = EBB-C = EBC-D = EBD-A = 4. Then, we double the relevance of A (RA = 2) maintaining RB = RC = RD = 1. The relevance-embedding betweenness becomes: BA = BC = 1 and BB = BD = 2, for vertices and EBA-B = EBD-A = 7 and EBB-C = EBC-D = 5 for edges. Consequently, embedding the intrinsic relevance increases the betweenness of vertices and edges which need to be traversed to reach the most relevant vertices.

Figure 5 reports the shortest paths and the formulae to compute the betweenness and the edge betweenness in the case of a weighted network, i.e. assuming the edge weights wA-B = 0.5 and wB-C = wC-D = wD-A = 1. Figure 5 is useful to show the different roles of edge weights and relevance of vertices in determining the betweenness.

The standard assumption (RA = RB = RC = RD = 1) provides betweenness values BA = BB = 2 and BC = BD = 0 for vertices and EBA-B = 6, EBB-C = 4 and EBC-D = EBD-A = 2 for edges. We here double the relevance of A (RA = 2), the betweenness becomes: BA = 2, BB = 4 and BC = BD = 0 for vertices and EBA-B = 8, EBD-A = 6, EBB-C = 2 and EBC-D = 4 for edges. Again, embedding the intrinsic relevance increases the centrality of the vertices and edges which need to be traversed to reach the most relevant vertices.

The results for the simple regular network of Figs. 4 and 5 confirm the findings of the degree and harmonic centrality: the vertex intrinsic relevance is an exogenous information to the standard network analysis, which can play an important role together with the network topology (connectivity structure and edge weights) in assessing the centrality ranking.

A first aspect that deserves to be underlined is that the vertex relevance is an exogenous information depending on the examined network and on the type of analysis to be performed. For example, in the case of infrastructure networks characterized by source vertices supplying water or energy to other vertices, the vertex relevance could be equal to the supplied water and energy for the source vertices and the demand for the other vertices. Moreover, the specific intrinsic relevance of some vertices (e.g., strategic buildings such as hospitals or schools) can be considered increasing suitably their corresponding relevance Rv beyond the specific (water or energy) demand. Similarly, in the social networks the intrinsic importance of a vertex (e.g., an institutional vertex) can be embedded by introducing suitable values Rv aiming to describe the “spectrum” of social intrinsic relevance of vertices. These are only few examples of relevance assignment; whose precise evaluation is problem-specific and then out of the scope of this work, maybe a further study of the CNT community once accepted the present proposal.

A second important point is the conceptual difference between the edge weights and the intrinsic relevance of vertices. The edge weights account for connections strength and play a role in determining the shortest path and the distance between vertices while the intrinsic relevance of vertices scales the inverse distance (harmonic centrality) or determines the importance of the shortest paths (betweenness).

About the function f(Rs,Rt), we argue that its structure is problem-dependent and the selection of a specific function allows to embed a diverse exogenous information in the standard centrality metrics. For example, assuming f(Rs, Rt) = Rs the degree d(s) and closeness C(s) are simply scaled by Rs and the relevance of the vertex s does not influence its neighbors, meaning that we are only increasing the degree and the capacity to transfer information of the specific vertex.

It follows that f(Rs, Rt) can be inferred as a constitutive function defining the specific features of the network at assigned topology. In other words, our intrinsic relevance-based approach can be interpreted as the discrete analogue of a continuum model in physics, where one can describe several phenomena based on the same differential equation whereas the coefficients (here, the function f(Rs, Rt)) depend on the specific features of the problem at hands. Thus, the constitutive function f(Rs, Rt) allows one to specify the physical networked system under analysis. The more detailed is the knowledge of the constitutive function the more precise will be the analysis. Furthermore, the availability of a theory about intrinsic relevance-based metrics allows one to design experiments to define the function f(Rs, Rt) more suitable for specific physical networked systems.

However, two (already mentioned) conditions should be considered: (i) the relevance-embedding centrality metrics should be a generalization of the classic ones, therefore f(1,1) = 1 and (ii) f should be monotonically increasing. The second condition follows from the fact that as the vertex relevance increase, it should increase the centrality metrics. Few examples of functions satisfying the previous constraints are: (i) f(Rs,Rt) = Rs·Rt; (ii) f(Rs,Rt) = (Rs + Rt)/2; (iii) f(Rs,Rt) = Rs and (iv) f(Rs,Rt) = max[Rs, Rt]; (v) f(Rs, Rt) = ΣRpath and (vi) f(Rs, Rt) = ΠRpath (where Rpath indicates the relevance of vertices crossed in the path).

Finally, it is worth to notice that the values f(Rs,Rt) can also be stored in a matrix having the same size of the adjacency one, having null diagonal elements. This paves a matrix-based definitions of f(Rs,Rt), generally asymmetric (i.e., f(Rs,Rt) ≠ f(Rt,Rs)), built not considering an explicit function but observing at the specific analysed networked system.

In order to complete the assessment of the novel intrinsic relevance-based metrics proposed in this work, the supplementary material (see Supplementary Figures 1A–24B) reports their application to two regular networks of 100 and 1,000 vertices and two random networks of the same size, generated using the Watts and Strogatz model20 with mean degree d = 10 and probability p = {0,1}. The standard betweenness and harmonic centrality were computed for each network, while the novel metrics were computed using each one of the six functions f(Rs, Rt) previously defined. The intrinsic relevance was assigned to vertices adding to the basic unit value a random value sampled from a uniform distribution in the range [0; d]. At first, a fraction, r, of 10% of vertices was randomly selected and the intrinsic relevance was randomly assigned. Then, the intrinsic relevance was randomly assigned to all the vertices (r = 100%) in the same range [1; 1 + d]. Therefore, for each type of network (regular and random, with 100 and 1,000 vertices) we considered three cases: (i) all vertices share the same relevance equal to one, (ii) a fraction r = 10% of vertices has random relevance in the range [1; 1 + d], and (iii) all vertices (r = 100%) exhibit random relevance in the range [1; 1 + d].

The tests reported in the supplementary material (see Supplementary Figures 1A-24B) show a different finding for the relevance-embedding betweenness and harmonic centrality as consequence of the metrics different meaning.

About the betweenness centrality, the tests show that:

• for regular networks, the intrinsic relevance is always an important external information to characterize the specific features of the problem. I.e., the correlation between classic and extended metric is low;

• for random networks, the intrinsic relevance is an important external information when it concerns the 10% of vertices, while the role vanishes assigning a random relevance to all the vertices. I.e., the correlation between classic and extended metric is low for r = 10% and increases for r = 100%;

• increasing the size of the random network, the role of the intrinsic relevance vanishes when randomly assigning it to all the vertices (r = 100%). I.e., the correlation between classic and extended metric increases;

• f(Rs, Rt) based on the vertices of the path or based on the product of the ending vertices of the path emphasize the role of the intrinsic relevance;

• the intrinsic relevance is not correlated to the standard betweenness when f(Rs, Rt) depends on the ending vertices of the paths. This is due to the specific meaning of the metric;

• the intrinsic relevance of vertices becomes to be correlated to the standard betweenness when f(Rs, Rt) depends on all the vertices of the paths because the most relevant vertices contribute to the metric values when traversed.

About the harmonic centrality, the tests show that:

• the relevance-embedding metric is always an important external information to characterize the specific features of the problem, both for regular and random networks. I.e., the correlation between classic and extended metric is always low;

• the intrinsic relevance of vertices is quite always correlated to the harmonic centrality because the value of the metric for a vertex is at least scaled by its intrinsic relevance f(Rs, Rt) = Rs;

• the intrinsic relevance of vertices is not correlated to the harmonic centrality when f(Rs, Rt) depends on all the vertices of the paths, because the intrinsic relevance of all the vertices in the shortest paths determines the metric value.

Finally, it is to bear in mind that the concept of intrinsic relevance for some networks refers to few vertices characterized by high values playing the role of “intrinsic relevance hub” as in the case of networked systems with sources (the following real cases will make clear this point).

## Two Real Examples: the Florence Family’s Network and an Infrastructure Water Supply System

The effectiveness and importance of embedding the vertex intrinsic relevance is now shown by means of two different types of network. The first one is the Florence family’s network21; it is a social network frequently used as test case in the studies about centrality22,23,24. The second example is an infrastructure (water) network; this case will be useful to demonstrate the role played by source nodes and strategic customers.

In the following, we focus on the relevance-embedding betweenness centrality. The results corresponding to the relevance-embedding degree and harmonic centrality are reported in the Supplementary Material, although a discussion in the following text is delivered.

### Betweenness centrality for the Florence family’s network

The Florence family’s network, reported in Fig. 6, considers the seventeen most notables Renaissance Florentine families as vertices and the corresponding twenty-three marriages as edges. The network is not weighted. If the standard betweenness is computed (i.e., Rv = 1 is assumed), we obtain the vertex and edge ranking shown in the Fig. 6 (see Supplementary Tables S1 and S2 for the list of values), where the vertex centrality is represented by the family’s emblem size and the edge betweenness is identified by the marriage link colour.

Figure 6 shows that Guasconi family is the most central family and the marriage between Peruzzi and Castellani families is the most important link. Nevertheless, this picture sounds quite strange; in fact, all history books have always reported that Medici is the most important Florentine family. Therefore, our CNT analysis based on the marriage topology is missing some key information. We think that this information is the intrinsic relevance of each family, evaluated by the gross wealth (i.e., the sum of marital, trade, partnership, bank and real estate relations) quantified in florins21. The gross wealth of each family is reported close to the family name in Fig. 7.

The novel betweenness embedding the family intrinsic relevance is computed using the function f(Rs,Rt) = Rs·Rt. Figure 7 shows that taking into account the vertex intrinsic relevance depicts a different (and more realistic) picture with respect to the standard betweenness: Medici becomes the most central family and the edge between Medici and Guasconi is the most important, i.e. the marriage between the two families (the list of values can be found as Supplementary Tables S3 and S4) is the most central. The results in Fig. 7 show that the family most likely to be traversed by the socio-economic activities is Medici, i.e. the most central in the socio-economic structure of the Florence families. The result is coherent with the History and it emerges considering the exogenous information of the intrinsic relevance in the standard CNT betweenness. In fact, although Medici has not the greatest gross wealth (i.e., intrinsic relevance), that family results the most central in the network because it is always traversed by the paths between the four of five richest Florentine families (Medici excluded), not being these four families linked by marriages. Namely, it is the coupling and interplay between topology and intrinsic relevance that make Medici the most central. Finally, the most important marriage (that one between Medici and Guasconi) explains and supports the centrality of Medici.

### Degree and harmonic centrality for the Florence families network

We here compute the standard degree and harmonic centrality and then the same metrics embedding the intrinsic relevance.

The degree ranges from 1 to 6 (see Supplementary Table S5 for the list of values) and the Guasconi, Albizzi and Peruzzi families are the most important hubs, being connected to six other families by marriages. The harmonic centrality ranges from 5.817 to 10.667 (see Supplementary Table S5 for the list of values). Guasconi and Peruzzi are the most central as capacity to spread socio-economic activities in the network closely followed by Peruzzi family.

The degree embedding intrinsic relevance ranges between 0 to 40.78E + 11 (see Supplementary Table S6 for the list of values). Guasconi family becomes the most important socio-economic hub, being a rich family (intrinsic relevance equal to 341,198 florins) connected with six families by marriages. But the novel degree informs that Strozzi family, the richest one (intrinsic relevance equal to 407,296 florins) and connected with five families with marriages (including Guasconi), becomes the second socio-economic hub. Overall, the example shows that socio-economic influence of a family on its neighbours is relevant if the family is rich and well connected (by means of marriages) with other rich families.

The harmonic centrality ranges from 1,35E + 08 to 6,08E + 11 (see Supplementary Table S6 for the list of values). Guasconi remains the most central family to spread socio-economic activities through the network because of its economic relevance and topological position into the network of marriages. Again, Strozzi becomes the second in the ranking because of its economic relevance and position in the network of marriages.

Therefore, we can state that the degree and harmonic centrality embedding the intrinsic relevance of vertices allows to obtain a different information from the standard CNT analyses. In the present case study, the intrinsic relevance allows to integrate the economical information of the family relevance with the social information inherent the marriage network.

### The water distribution network

The analysis of a distribution infrastructure highlights even more the need of embedding the intrinsic relevance of vertices for the centrality evaluation. To show this, here we refer to a simple water supply network composed of twenty-four vertices (that represent twenty-three demand nodes and one source node) and thirty-four edges corresponding to the pipes for the water distribution25 (see Fig. 8). The edges are weighted with the length of pipes to account for the fact that it is a spatial network. We here focus on the edge centrality because the pipes are the relevant components for distribution systems26.

If the standard edge betweenness is computed – i.e., the same intrinsic relevance is assigned both to source and demand nodes – the outcomes are those shown in the Fig. 8 (left): the most important edge is the number 4 followed by the number 17 (see  the Supplementary Table S7 for the list of values). However, these results are unrealistic; in fact, it is evident that the most important edge for the distribution network corresponds to the pipe connecting the network to the source of water (the edge 34 connected to the vertex 24) because all the paths from the source of water always traverse that edge. Once again, we are missing information during the CNT analysis, i.e. the intrinsic relevance of the source vertex (node 24), which supplies water to the twenty-three demand nodes. In order to make centrality assessment more realistic, the intrinsic relevance is assigned equal to: (i) the water demand for each vertex corresponding to a demand node and (ii) the sum of supplied water for the source node. Figure 8 (right) reports the edge ranking as resulting from the edge betweenness embedding the vertex intrinsic relevance (we assume f(Rs,Rt) = Rs·Rt). The demands, in [l/s], are reported in parenthesis close to each vertex. Differently from the standard betweenness, the novel edge betweenness correctly identifies the pipe 34 as the most important edge, consistently with the hydraulic engineering knowledge (see the Supplementary Table S8 for the list of values).

We here consider the same water supply network with the further assumption that a strategic consumer, a hospital at the demand node 10, is present. Aiming to consider the peculiarity and importance of the hospital (whose failure to supply water would cause serious damage), the intrinsic relevance is augmented to ten times of its demand. Figure 9 reports the novel edge betweenness embedding the intrinsic relevance of the hospital (see the Supplementary Table S9 for the list of values): the edge 34 results again the most important pipe, but the main path is now identified by vertices 24–13 and not 24–8, as it was instead obtained when intrinsic relevance of vertex 10 was equal to its demand (see Fig. 8, right panel). This fact demonstrates that the function f(Rs,Rt) = Rs·Rt correctly emphasizes the most important pipes for water supplying security at the hospital.

## Conclusions

The aim of the present work is to draw attention to the importance of embedding the information about the intrinsic relevance of vertices into CNT tools to enhance the network analysis. The usual assumption of identical relevance of vertices makes the centrality assessment only founded on topological features (on network connectivity structure and, possibly, on edge weights) causing the ineffectiveness of the network analysis when such exogenous information is relevant.

The information about intrinsic relevance can refer to different occurrence: e.g., institutional roles, strategic values of the vertices (e.g., hospitals, embassies, schools, stations, etc. in the infrastructure networks), functions of the vertices in the network (source vs. demand nodes), etc. The key idea of the proposal of embedding intrinsic relevance in CNT is to avoid losing exogenous information about vertices.

We focused on the degree, (harmonic) closeness and betweenness metrics, being among the most used, proposing relevance-embedding formulations and demonstrating their effectiveness. In fact, using two examples concerning a social and an infrastructure network, we demonstrated the crucial role played by intrinsic relevance in assessing the correct vertex and edge ranking.

We think that capturing the interplay between network topological structure and intrinsic relevance of vertices can open novel interesting paths in the CNT studies and applications to real problems. Our work wishes to be a step in this direction.

## References

1. 1.

Cohen, R. & Havlin, S. Complex networks: structure, robustness, and function. (Cambridge University Press, 2010).

2. 2.

Newman, M. E. J. Networks (Oxford University Press 2010).

3. 3.

Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002).

4. 4.

Fortunato, S. Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010).

5. 5.

Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwanga, U. Complex networks: structure and dynamics. Physic Report 424(4-5), 175–308 (2006).

6. 6.

Barthélemy, M. Morphogenesis of Spatial Networks. (Springer International Publishing, 2018).

7. 7.

Freeman, L. C. A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977).

8. 8.

Katz, L. A new status index derived from socio metric analysis. Psychometrika 18(1), 39–43 (1953).

9. 9.

Bonacich, P. Power and centrality: a family of measures. Amer. J. Sociology 92(5), 1170–1182 (1987).

10. 10.

Page, L., Brin, S., Motwani, R. & Winograd, T. The PageRank Citation Ranking: Bringing Order to the Web. Proceedings of the 7th International World Wide Web Conference, 161-172. Brisbane, Australia, (1998).

11. 11.

Kleinberg, J. M. Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999).

12. 12.

Marchiori, M. & Latora, V. Harmony in the small-world. Physica A: Statistical Mechanics and its Applications 285(3–4), 539–546 (2000).

13. 13.

Leung, I. X. Y., Chan, S.-Y., Hui, P. & Liò, P. Intra-City Urban Network and Traffic Flow Analysis from GPS Mobility Trace, ArXiv:1105.5839. (2011).

14. 14.

Heitzig, J., Donges, J. F., Zou, Y., Marwan, N. & Kurths, J. Node-weighted measures for complex networks with spatially embedded, sampled, or differently sized nodes. Eur. Phys. J. B 85, 38 (2012).

15. 15.

Wiedermann, M., Donges, J. F., Heitzig, J. & Kurths, J. Node-weighted interacting network measures improve the representation of real-world complex systems, (EPL). Europhys Lett 102(2), 28007 (2013).

16. 16.

Topirceanu, A., Udrescu, M. & Marculescu, R. Weighted Betweenness Preferential Attachment: A New Mechanism Explaining Social Network Formation and Evolution. Scientific Reports 8, 10871 (2018).

17. 17.

Amano, S., Ogawa, K. & Miyake, Y. Node property of weighted networks considering connectability to nodes within two degrees of separation. Scientific Reports 8, 8464 (2018).

18. 18.

Agryzkov, T., Tortosa, L. & Vicent, J. F. New highlights and a new centrality measure based on the Adapted PageRank Algorithm for urban networks. Applied Mathematics and Computation 291, 14–29 (2016).

19. 19.

Agryzkov, T., Tortosa, L., Vicent, J. F. & Wilson, R. A centrality measure for urban networks based on the eigenvector centrality concept. Environment and Planning B: Urban Analytics and City Science 46(4), 668–689 (2019).

20. 20.

Watts, D. J. & Strogatz, D. H. Collective dynamics of small-world networks. Nature 393, 440–442 (1998).

21. 21.

Padgett, J. F. & Ansell, C. K. Robust Action and the Rise of the Medici, 1400-1434. The American Journal of Sociology 98(6), 1259–1319 (1993).

22. 22.

Alvarez-Socorro, A. J., Herrera-Almarza, G. C. & González-Díaz, L. A. Eigencentrality based on dissimilarity measures reveals central nodes in complex networks. Scientific Reports 5, 17095 (2015).

23. 23.

Latora, V., Nicosia, V. & Russo, G. Complex Networks Principles, Methods and Applications, Cambridge University Press (2017).

24. 24.

Sciarra, C., Chiarotti, G., Laio, F. & Ridolfi, R. A change of perspective in network centrality. Scientific Reports 8, 15269 (2018).

25. 25.

Giustolisi, O. & Ridolfi, L. New Modularity-Based Approach to Segmentation of Water Distribution Networks. Journal of Hydraulic Engineering, 140(10), (2014).

26. 26.

Giustolisi, O., Ridolfi, L. & Simone, A. Tailoring Centrality Metrics for Water Distribution Networks. Water Resources research 55(3), 2348–2369 (2019).

## Author information

Authors

### Contributions

O.G. proposed the idea, O.G., L.R. and A.S. developed the analytical theory of the idea and conceived the case studies, A.S. designed the case studies, all authors contributed to the writing of the article.

### Corresponding author

Correspondence to Orazio Giustolisi.

## Ethics declarations

### Competing interests

The authors declare no competing interests.

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

Reprints and Permissions

Giustolisi, O., Ridolfi, L. & Simone, A. Embedding the intrinsic relevance of vertices in network analysis: the case of centrality metrics. Sci Rep 10, 3297 (2020). https://doi.org/10.1038/s41598-020-60151-x

• Accepted:

• Published:

• ### Network analysis of population flow among major cities and its influence on COVID-19 transmission in China

• Jie Liu
• , Jingyu Hao
• , Yuyu Sun
•  & Zhenwu Shi

Cities (2021)

• ### Complex Networks Theory for Evaluating Scaling Laws and WDS Vulnerability for Potential Contamination Events

• Matteo Nicolini

Water (2020)