Opinion Formation on Social Networks—The Effects of Recurrent and Circular Inﬂuence

: We present a generalised complex contagion model for describing behaviour and opinion spreading on social networks. Recurrent interactions between adjacent nodes and circular inﬂuence in loops in the network structure enable the modelling of inﬂuence spreading on the network scale. We have presented details of the model in our earlier studies. Here, we focus on the interpretation of the model and discuss its features by using conventional concepts in the literature. In addition, we discuss how the model can be extended to account for speciﬁc social phenomena in social networks. We demonstrate the differences between the results of our model and a simple contagion model. Results are provided for a small social network and a larger collaboration network. As an application of the model, we present a method for proﬁling individuals based on their out-centrality, in-centrality, and betweenness values in the social network structure. These measures have been deﬁned consistently with our spreading model based on an inﬂuence spreading matrix. The inﬂuence spreading matrix captures the directed spreading probabilities between all node pairs in the network structure. Our results show that recurrent and circular inﬂuence has considerable effects on node centrality values and spreading probabilities in the network


Introduction
Research on social networks is a growing field of study in network science [1], social sciences [2][3][4][5][6], and mathematics. The availability of user-provided content in online social media [7,8] makes the spreading of disinformation and fake news easier. Recently, methods of how disinformation circulates on social media have been investigated [9]. Disinformation can have severe implications for democratic processes and human rights [10]. These present-day phenomena underline the importance of studying mechanisms of opinion formation. Methods and models can help us better understand and manage these unwanted developments.
In social network analysis, the concept of scope is used to assess the convincing ability of a user toward other users on social platforms. Other concepts such as centrality, reliability, power, reputation, influence, trust, and diffusion can be seen as different aspects of scope. In [7], researchers have studied how the scope of a sentiment propagates in space and time in a social network. The authors present a general framework for extracting information about the scope of the sentiment of a user on topics of any subject.
Despite the richness of publications addressing social networks from many perspectives, there are still open questions about how to classify social interactions and how to model both static properties and dynamic effects on social networks. In the current literature, few studies consider complex contagion processes with loops [11]. Theories of interactions on social networks involve describing various processes from information to opinion and behaviour spreading [12][13][14][15]. Epidemic spreading is closely related to social contact networks [16][17][18][19][20]. Researchers have recognised that diverse approaches this issue, we propose in Section 2 a microscopic-level spreading model that considers all paths in the network, including recurrent and circular structures.
The outline of this article is as follows. In the Model Section 2, we have two subsections. In Section 2.1, we present the main mathematical formulas used in this work. We refer to our earlier work [39][40][41][42][43][44] for the pseudo algorithms of the model that are useful in computer implementations. In Section 2.2, we introduce our model's microscopic features and their extensibility. In the Results Section 3.1, we present modelling results and their interpretation by using the concepts explained in the Introduction Section 1. In the out-and in-centrality measures Section 3.2.1 and in the Betweenness Section 3.2.2, these measures are demonstrated with a small social network. In Section 3.2.3 and in the Appendix A, a collaboration network is used to demonstrate the use of a larger network structure in the analysis. In the last Section, Section 3.2.4, we introduce a new application of our model to profile individuals in a social network. This study has two main contributions: First, we propose a new model for describing behaviour and opinion spreading on social networks. Second, we apply the proposed model for profiling individuals based on their out-centrality, in-centrality, and betweenness measures. The Conclusion Section 4 summarises the results and highlights the contributions of our work.

Model
In Section 2.1, we present the main mathematical ideas on how the spreading process is modelled by combining alternative paths of the network structure from source nodes to target nodes. Detailed algorithms are not reproduced here because they have been published in our earlier studies and the focus of this work is on the interpretation and application of the modelling framework. In Section 2.2, we provide information about the features and extensibility of our proposed model.

Mathematical Formulation
Our model describes a microscopic-level spreading mechanism, and it enables calculating spreading probabilities between all node pairs in the detailed network structure. Directed edges with individual weights for nodes and edges are considered in the model. The probability of influence spreading from a starting node through a path is the product of the weights of each edge and node on the path: where P(L) is the probability of spreading through the path L of k edges and nodes, and w e i and W n j are the weight of the jth edge and node on the path, respectively. The probabilistic interpretation is that all attempts to spread along the path must be successful. The weight of the starting node is not included in the product because we assume that the spreading starts from the node with probability one. In this study, to demonstrate our model, we use the same link weights for all links in the network and all node weights are assumed to be one. When empirical data are available, these parameter values are set to their actual observed or evaluated probability values. In our model, influence is spreading simultaneously through multiple paths in the network structure [39][40][41]. The method of spread is non-conserved; that is appropriate for describing the transitions of opinion spreading. We assume that the probabilities of influence spreading through different paths are independent.
The probability of spreading from a source node to target nodes is calculated by two paths at a time by using the well-known non-mutually exclusive formula of probability theory. We denote by P(L) the probability of influence spreading through path L. To calculate the probability of spreading through path L 1 or path L 2 , we use the probability for the longest common prefix (LCP) of the two paths. We denote the LCP by L 3 and its probability by P(L 3 ). In the case where L 3 is empty-that is, there is no common prefix-we assign P(L 3 ) = 1. The probability P(L 1 ∨ L 2 ) of spreading through L 1 or L 2 is Equation (2) is used iteratively by repeatedly applying the equation to include more and more paths in the calculation. The probabilities for the paths are combined in the descending order of the lengths of the longest common prefixes. As the final result, we obtain the total probability of influence spreading from any one node to any other one through all possible paths of maximum length L max .
The algorithm calculates the probabilities of influence spreading from a node to all other nodes. This is repeated for every source node s = 1, . . . , N of the network, and an N × N influence spreading matrix C(s, t) is formed. No restrictions are placed on breakthrough spreading through nodes. We have also developed an efficient algorithm [41] that does not have to store the paths in memory, making it very efficient even for larger networks.
The influence spreading matrix can be used in various applications for analysing social networks and their elements. Next, we present three different quantities [39,40], in-centrality, out-centrality, and betweenness centrality, that measure the importance of a node in a network. In the following, the set of nodes in the network is denoted by V. The in-centrality of node t is defined as and the out-centrality of node s as These quantities have a natural interpretation as expected values: the in-centrality is the expected number of nodes, from which influence will spread to it, and out-centrality is the expected amount of nodes influenced when the spreading is started from it. The in-centrality could represent, for example, how exposed an individual is to misinformation, and the out-centrality could represent the expected number of influenced individuals initiated by the source node.
We define betweenness centrality [39] b s for node s as the relative difference in the cohesion of the network when node s is removed from the network where C is the cohesion of the network and C s is the cohesion of the network with node s removed The betweenness centrality of a set of nodes can be defined similarly to the definition of the betweenness measure of a single node. The betweenness centrality could be used to find, for example, critical nodes that mediate information or influence between different parts of a network structure.

Microscopic Modelling and Extensibility
In our model describing influence spreading, connections between the nodes of a social network are modelled at a detailed level. We define the spreading ability of a node as the number of finally influenced nodes given that the spreading is initialised from the node [45]. Individual nodes and links have weights that are interpreted as probabilities of influence spreading through nodes and via links, respectively. Links are bi-directional, allowing different weights for both directions. In our earlier studies [20,[39][40][41][42]44], we have presented how temporal spreading can be studied in the detailed network. Different models for the temporal distribution can be used, for example, Poisson distribution or e-mail forwarding distributions [40]. In addition, empirical temporal distributions can be used as input for the model.
Since the distribution is defined as a two-dimensional matrix as a function of time and path length, the method also enables studying functional dependence on the path length; for example, an extra factor for decreasing influence as a function of path length can be incorporated into the model. Our model is global in the sense that path lengths between 1 and 20 can be used. Longer path lengths are beyond the accuracy of typical computing environments. Local effects can be investigated by using smaller parameter values for L max . Most of the network models in the literature consider only local interactions [38] or they are not based on the microscopic structure of the network.
The key element in our model is the method of how different spreading paths are processed to achieve the combined effects (Algorithm 1 in [41]). An efficient computer algorithm implementing the path combining method is developed for calculating effects in larger networks (Algorithm 2 in [41]). We have developed computer programs to analyse network structures in various applications [20,43]. Details of the algorithms and computer running times can be found in [41,46]. Details of the model have been explained in our earlier work, including comparisons of the efficiency of different models in [41,42]. In this work, we focus on interpretations of the model in the context of social interactions. We discuss how our proposed model is related to other models in the literature and how our model can be extended to include rules in considering specific real-world processes.
In [25], complex contagions are characterised as events that require social affirmation from multiple sources. We propose a new model where all interactions are allowed between individuals in a social network, recurrent interactions between neighbouring nodes, and circular influence spreading through loops in the network structure. In the basic model, we do not deploy any additional rules for the spreading process. One advantage of the proposed microscopic-level model is that different rules of interactions can be easily incorporated into the model. For example, thresholds [19] for successful events or breakthrough effects through influenced nodes are included. Multiple states and corresponding transition probabilities can be defined for the nodes in the network structure. This can be compared with the traditional SIR and SEIR models [37] in the literature of epidemic-spreading models.

Results
In Section 3.1, we explain the characteristics of our proposed model by using the conventional concepts introduced in Section 1. Essential here is the interpretation of circular influence through loops and repetitive influence between neighbouring nodes in the network structure.
In Section 3.2, we demonstrate our model with a small social network structure and a larger collaboration network structure. We compare the results of complex and simple contagion models. In addition, we provide a novel node profiling method based on the magnitude of node centrality measures and the ratio of out-and in-centrality values.

Features and Interpretation of the Model
Clearly, our model describes complex contagion in the sense that multiple nodes and links are involved in the interactions. The model allows circular interactions or loops and recurrent interactions between adjacent nodes, but self-loops are not implemented in the current version of the computer program. We deduce that these features are characteristic of behaviour and opinion spreading in social interactions. Our model includes Centola's complex contagion [25], but we have allowed influence spreading events to all connections in the network structure. This enables the modelling of influence spreading, or opinion formation, in the network. Other complex contagion models in the literature [26][27][28] lack these features, describe local interactions, are approximations, or are intended for other applications.
In addition, our methodology enables consistent definitions of in-centrality, outcentrality, and betweenness measures. In addition, community detection can be modelled with the same formalism [39,40]. We compare the results of our complex contagion model with a simple contagion model where only self-avoiding paths are allowed.
Both social homogeneity and social capital [32] can be modelled with our model by calculating network measures and assigning numerical values to network attributes or weights. As mentioned in Section 1, network mechanisms can be categorised as flow models and bond models. Our model is a flow model because it describes influence spreading as a spreading process. Modelling network bonds that align and coordinate actions is a subject for future study. Possible features of the model to be utilised include using link weights w = 1, setting initial values to node weights, and using unconventional distributions as temporal distributions.
Regarding categorisation into the event-or state-type [32] links, our model can be used for both types. Link weights can describe the strength, intensity, and duration of state-type links or the frequency of occurrence of event-type links. We have used this interpretation for link weights in our earlier study [47].
In addition, opinion dynamics [12] is described with continuous node state variables. Node states are probabilities of influence with values ranging between 0 and 1. The continuous node state value is interpreted as the level of agreement with an opinion, attitude, or topic of interest. Discrete node state variables can be defined by using a threshold for the continuous variable to indicate a state change from consideration to decision. If needed, new attributes can be assigned to nodes when more complex rules or more node states are required in the model.

Numerical Demonstrations
In our first example, we analyse a small real-world social network of 32 nodes [48]. From Figure 1, we can see that the network has a varied internal structure that can be useful in our demonstration. We have also used the same network for demonstrating community detection in [39].

Out-and In-Centrality Measures
Figures 2-5 show node-level out-centrality, and in-centrality values for link weights w = 0.05, 0.25, 0.5 and 0.75, respectively. Albeit the original study has recorded different attribute values for the nodes in the Dutch students' social network [48], we use the same link weights for all connections between the nodes. In this way, we can more clearly demonstrate the basic features of our model. In the actual analyses, both link and node weights should be taken into account. In our microscopic model, individual node and link weights are included in the calculation of the influence spreading matrix elements as explained in Section 3.1. We have kept nodes 5, 12, and 18 to preserve the same numbering of nodes as in earlier works. In our definitions of centrality and betweenness measures, we have the convention that source nodes themselves do not contribute to these quantities.  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Centrality w=0.05
The interpretation is clear: The social influence of individuals with low influence spreading probability values, or low link weights, is limited to short distances in the social network structure. With increasing link weights, node-level out-centrality and in-centrality increase. This is because the probability of influence between neighbouring nodes increases and because of the longer range of influence. This is a non-linear process because the structure of the network affects the spreading process.
Less obvious is that the node rankings (and relative values) can change for higher values of link weights. This can happen because distant nodes with larger degrees have more influence on the spreading process. However, this is not the whole story. In our proposed model, recurrent interactions between neighbouring nodes and circular interactions in loops enhance these effects.
Recurrent and circular effects can change the relative importance or rankings of nodes when compared with simple contagion models. As we mentioned, with low link values only the links between the source node and neighbouring nodes are relevant. For this reason, the simple contagion model with self-avoiding paths provides similar results when link weights are small. Simple contagion results are shown in Figure 6, where we can see that node rankings are preserved when link weights are increased. This does not generally hold for our complex contagion model.  4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30  Before we investigate the dependence of node rankings on link weights, we notice from Figures 2-5 that node-level in-centrality and out-centrality values are different for higher link weights. These values are similar for each node for low link weights (see Figure 2). Again, the reasoning is that only the links incident to the node have effects. Clearly, this holds only for undirectional and equally weighted links. In the complex contagion model for higher link weights, it depends on the network structure whether the out-centrality or the in-centrality value is higher for a node.
From Figure 3, we can see that with link weights w = 0.25, out-centrality values are higher for nodes 4,8,10,17,20,22,27,30, and 31. These nodes are well-connected, and their neighbours typically have connections with each other. For node 3 with link weights w = 0.25, the out-centrality and in-centrality values are almost equal. This is a consequence of its different position in the network compared to nodes 10 and 27. Let us compare node 7 with nodes 4, 8, 17, 22, and 30. They all have four degrees, but the in-centrality of node 7 is higher than out-centrality for link weight w = 0.25. This can be explained by the lower local connectivity of node 7 compared to the other nodes. For node 7 with higher link weights, out-centrality is higher than in-centrality, as can be seen from Figures 4 and 5. With higher link weights, distant well-connected nodes with loops enhance the influence of node 7 to other nodes. This phenomenon is not so important for in-centrality because the influence of distant nodes on node 7 are averaged over multiple source nodes from different distances and loops, on average, have weaker effects.
Nodes 27, 10, and 3 dominate in Figure 2 as influential spreaders with low link weights; however, in Figure 4 with higher link weights, there are about ten nodes with similar capabilities. With higher link weights w = 0.5 also node 3 has a higher out-centrality value than in-centrality value. Figure 5 shows that both out-centrality and in-centrality values approach the number of nodes in the network or the number of nodes in a connected component in the network. In-centrality values are more even, but some peripheral nodes such as nodes 2, 9, 11, 25, 26, and 32 still have relatively low out-centrality values.
The interpretation in the context of social networks is that an individual's role as an influencer or an influenced person depends on the position in the social network structure. Often, however, a central person has both roles at the same time; only the dominant role can vary. The second result that the dominant role can change when the strength of social influence changes is a novel result of our influence spreading model that considers circular interactions at different distances. The third observation is that weakly connected and isolated individuals have low influence on other people but they may still be influenced by the larger social network. Figure 6 shows centrality values with different link weights for nodes of Figure 1 in the simple contagion model with self-avoiding paths. In this model, recurrent and circular effects are not allowed. As a consequence, rankings are preserved with increasing link weights. With bi-directional and equally weighted networks, in-centrality and out-centrality values are equal and only the centrality values are presented.
This kind of simple contagion model can describe information spreading where the same piece of information is communicated only once between neighbouring individuals in the social network structure. Real-world contacts in social networks can have different types of interactions. Opinion formation, for example, can involve simultaneous simple contagion and complex contagion interactions. These kinds of spreading mechanisms can be described by models with breakthrough effects. We have proposed a unifying model [41] where the probability of a breakthrough event can be set between 0 and 1. The general model with breakthrough effects is beyond the scope of this study, but the general idea is to adjust the ratio between simple and complex contagion according to the modelled spreading process.

Betweenness Measure
Betweenness measures a node's role as a mediator in the network structure. The definition of the traditional betweenness measure for node v is based on the total number of shortest paths and the number of shortest paths through node v. Paths where node v is an endpoint are not included in the calculation. There are versions for weighted networks and state-aware networks considering the states of the source and target nodes of each shortest path. Reviews of standard centrality and betweenness measures in the literature can be found in [33,35].
Our definition of the betweenness measure in Equation (5) is based on the same influence matrix as the in-and out-centrality measures in Equations (3) and (4) in Section 3.2. We have calculated the results for our example network in Figure 1 for the complex contagion model in Figure 7 and for the simple contagion model in Figure 8. As can be seen, the results are almost similar for the two models. There is a minor difference in the w = 0.25 results, which are relatively larger in the complex contagion model in Figure 7 than in the simple contagion model in Figure 8. Altogether, the betweenness measure, as defined in Equation (5), is relatively less dependent on link weights than out-and in-centrality measures in Equations (3) and (4). For example, the ranking of nodes is almost independent of the link weight values.

Demonstration with a Larger Network Structure
Next, we demonstrate our model results with the larger network structure of 4158 nodes and 13,422 bidirectional links in Figure 10. The data for the Collaboration network [49] have been gathered from the e-print arXiv. The network is based on collaborations between authors on manuscripts submitted to the General Relativity and Quantum Cosmology category. Nodes in Figure 10 represent authors, and edges are collaborations between them. A manuscript of k authors will result in a completely connected subgraph of k nodes. Figure 11 shows out-centrality and in-centrality values calculated from the complex contagion model where the horizontal axis presents nodes arranged by the out-centrality values in ascending order. The results in Figure 11 illustrate the general features of the model and also some specific characteristics of the network structure. All figures show the different behaviour of out-and in-centrality. Typically, out-centrality values are increasing and in-centrality values are almost constant in most cases. For low link weights, outcentrality values are larger than in-centrality for the majority of nodes. This is reversed for high link weights: w > 0.25 in this case.
With very low link weight values, w < 0.025 in this network, out-and in-centrality values are approximately equal because only the links to neighbouring nodes have effects (see Figure A1 with w = 0.025). Out-centrality reveals network structures more clearly. When link weights are w = 0.05, out-centrality values are low except for a set of nodes that are members of larger collaboration groups. With higher link weights, smaller collaboration groups also have effects on the curves.
In the Appendix Figure A1, we show an example of the effects of delimiting the path lengths L ≤ 10. As expected, both out-and in-centrality values are lower than in the corresponding results with higher maximum path length values (L max = 18 in Figure 11). Interesting structures are revealed in out-centrality values with high link weights. In this study, we do not investigate these results in more detail because they are outside the scope of this work. In Section 3.2.4, we present an example of how the proposed model can be used to examine different roles of individuals in a selected group of people according to their out-centrality, in-centrality, and betweenness values.

Profiling
As an application, we present how the out-centrality, in-centrality, and betweenness measures can be used to profile individuals. This is possible and consistent because all these measures are defined based on the same influence spreading matrix introduced in Section 2.1. First, we explain the idea with a small test network of Figure 12. The same network structure has been used in [34] to demonstrate conventional centrality measures and their inconsistencies.  Figure 13 shows centrality measure values for the complex contagion model with link weights w = 0.05, 0.25, 0.5, and 0.75. As we know from Section 3.2.1, the rankings of nodes in the simple contagion model are similar to the rankings in the complex contagion model with low link weights. Therefore, Figure 13a has the information for both models. On the other hand, in our profiling demonstration, we use only the complex contagion results because our novel idea is based on node-level differences in out-and in-centrality values.  As we have seen in Sections 3.2.1 and 3.2.2, rankings and numerical values of outcentrality and in-centrality can change as a function of link weights. Usually, these variations can only change some details in our analysis. However, these details can be important in some specific real-world cases if a node is profiled differently. We take as our representative example w = 0.25 in Figures 13b and 14a.
In Figure 15, we demonstrate with the test network of Figure 12 how profiling could be performed. Detailed parameter values and classification can be designed for specific purposes and different network sizes.
We have used the following rules for the 'Peripheral', 'Central', and 'Mediator' roles: • If the node's ratio of the in-centrality to out-centrality is larger than 1. The idea is to group different combinations into classes. We can identify four classes, ignoring the parentheses. These are indicated by the brown, green, and blue colours in Figure 15. We could have a more detailed classification. For example, node 5 has strong roles as 'Peripheral', 'Central', and 'Mediator'. By looking at Figure 12, we realise the special position of the node. Node's roles as 'Central' and 'Mediator' are clear. Role 'Peripheral' is assigned to node 5 because its neighbours 4 and 6 are not connected with each other. Next, we present an example of how profiling can be performed for a group in a larger network. We selected one node (Node 1 in the example) and its neighbours from the network structure of Figure 11. Then, we set node weights of these nodes w n = 0.25 and all the other node weights w n = 0 or w n = 0.025. These values should be designed for the specific application at hand. In Figure 16a,b out-centrality, in-centrality, and betweenness values are shown for the seven nodes of the group.
Technically, the numerical values are normalised to have equal sums for the three measures. Out-and in-centrality sums for the entire network are equal but, in general, they are not equal for a subset of nodes of the network. As we have used node weights instead of link weights, the influence of each link originating from the group members has a weight w = 0.25, but the influence of each link from outside of the group has a weight of w = 0.0 or w = 0.025. We can see that in this case, the results are almost similar for the two cases where we have used different weights for the nodes outside of the group. Again, this is not universally true as it depends on the network structure. The interpretation for using non-zero node or link weights is that the group is not isolated from the outside world but has interactions with others in the social network. Parameter values should be designed for the specific situation and type of social influence to be modelled. Based on the results in Figure 16, classifications such as those in Figure 17 can be produced.    The method is based on the fact that out-centrality and in-centrality values for a node can be different even in the case of bidirectional equally weighted links. This is contrary to the simple contagion model with self-avoiding paths where the node-level out-centrality and in-centrality values are equal. Usually, these values are different for networks with directed and weighted links. Recurrent and circular effects in the influence spreading process have significant effects in the profiling results, as well as in the centrality and betweenness results.

Conclusions
We have highlighted the properties and interpretations of our influence spreading model proposed in our earlier studies [20,[39][40][41][42]44]. Our model considers microscopic-level recurrent and circular effects in the influence spreading process on social networks. In the literature, the need for new models has been recognised and the concept of complex contagion [25], as opposed to simple contagion, has been introduced to point out this research gap. We used a version of a simple contagion model with self-avoiding paths to verify that our proposed model produces different results than the corresponding simple contagion model.
New out-centrality, in-centrality, and betweenness measures are defined consistently with the influence spreading model. The definitions are based on the influence spreading matrix of the model. We demonstrated these measures with a well-known social network of 32 Dutch students social network and a larger collaboration network. As a novel application, we presented ideas on how profiling could be performed by using our model and corresponding influence measures. The proposed method is based on the fact that the out-centrality and in-centrality values can be different.
The contributions of this study include discussing the interpretations of our spreading model in the context of behaviour and opinion spreading on social networks. The novelty of our model is how to consistently consider recurrent and circular interactions in the network structure. We demonstrated that the model with measures calculated from the influence spreading matrix generated from our model. In this study, we apply the proposed model for profiling individuals based on their out-centrality, in-centrality, and betweenness measures.
Funding: This research received no external funding.

Conflicts of Interest:
The author declares no conflict of interest.

Abbreviations
The following abbreviations are used in this article:

CC
Complex Contagion SC Simple Contagion LCP Longest Common Prefix

Appendix A
Here, we demonstrate the effects of limiting the maximum path length of the spreading process. In the example of Figure A1, the path lengths are limited to L ≤ 10. Link weight values w = 0.025, 0.05, 0.25, 0.5, 0.75, and 0.95 are used for all links in the network. The first figure illustrates that node-level out-and in-centrality values are approximately equal with low link values w ≤ 0.025. With a slightly higher link weight value w = 0.05, out-centrality values are higher and increasing when the nodes on the horizontal axes are arranged in the order of ascending out-centrality values. For a small set of highly connected nodes, the out-centrality values are higher than i-centrality values. Limiting the values of L requires the use of higher link weights to have comparable spreading probabilities as with higher L. However, limiting L has complex effects caused by the complex structure of the network. For example, the network structure has an impact on both out-centrality and in-centrality results (see w = 0.5, 0.75 results in Figure A1).   Figure A2. Numerical values of in-centrality, out-centrality and betweenness measure values in Figure 9 (link weights w = 0.25). Betweenness values are calculated from Equation (5) and they are not normalised. Degrees of the nodes can be seen directly from Figure 1.