The connectedness of node i to partition P is denoted by C i, P, and computed as: C i, P = ∑ j ∈ P j ≠ i ( e i, j + e j, i ) S i + T i − 2 m i, i, (7).
The high relative connectedness of the nodes in the traditional network resulted in relative decrease in network distances between nodes.
To compute border strength, we start by defining the connectedness of each node (in our study, cell-tower) to each partition.
Again a "degree" is the connectedness of any node to the network and network distributions take any of several forms including Gaussian, which is commonly observed in random networks or non-Gaussian forms including distributions with a fat tail (e.g., scale free networks).
Degree Centrality - this is a metric of the connectedness of a node.
Clustering coefficient C, describing the level of topological local connectedness of a node.
Metrics included (see also Supplementary Materials): Clustering coefficient C, describing the level of topological local connectedness of a node.
The degree of connectedness (CND) of node i, indicating how many other nodes are connected to node i, is mathematically defined as: k_{CN,i} = sumlimits_{j = 1}^{{N_{N} }} {M_{A} (i,j)}.
The literature indicates that the core features of social-professional networks are their deep structure, how they enable change, how information is facilitated by and in them, the processes of information distribution and search, the circumstances in which phase transitions occur, connectedness of hubs and nodes and the conditions which dictate their robustness or fragility [ 23- 27].
In log log plots relating the number of nodes with the degree of connectedness, expressed as cumulative probability, the empirical distribution deviated from a straight line (Fig. 6 A ) as the frequency of nodes with large numbers of connections was lower than expected for scale-free networks.
