Efficiency (network science)

Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Multi Random Weighted
Metrics Algorithms
Centrality Degree Betweenness Closeness PageRank Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

In network science, the efficiency of a network is a measure of how efficiently it exchanges information ^[1] and it is also called communication efficiency. The underlying idea (and main assumption) is that the more distant two nodes are in the network, the less efficient their communication will be. The concept of efficiency can be applied to both local and global scales in a network. On a global scale, efficiency quantifies the exchange of information across the whole network where information is concurrently exchanged. The local efficiency quantifies a network's resistance to failure on a small scale. That is the local efficiency of a node [math]\displaystyle{ i }[/math] characterizes how well information is exchanged by its neighbors when it is removed.

Definition

The definition of communication efficiency assumes that the efficiency is inversely proportional to the distance, so in mathematical terms

[math]\displaystyle{ \epsilon_{ij} = \frac{1}{d_{ij}} }[/math]

where [math]\displaystyle{ \epsilon_{ij} }[/math] is the pairwise efficiency of nodes [math]\displaystyle{ i, j \in V }[/math] in network [math]\displaystyle{ G = (V, E) }[/math] and [math]\displaystyle{ d_{ij} }[/math] is their distance.

The average communication efficiency of the network [math]\displaystyle{ G }[/math] is then defined as the average over the pairwise efficiencies:^[1]

[math]\displaystyle{ E(G) = \frac{1}{N(N-1)} \sum_{i \neq j \in V} \frac{1}{d_{ij}} }[/math]

where [math]\displaystyle{ N = |V| }[/math] denotes the number of nodes in the network.

Distances can be measured in different ways, depending on the type of networks. The most natural distance for unweighted networks is the length of a shortest path between a nodes [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math], i.e. a shortest path between [math]\displaystyle{ i, j }[/math] is a path with minimum number of edges and the number of edges is its length. Observe that if [math]\displaystyle{ i= j }[/math] then [math]\displaystyle{ d_{ij} = 0 }[/math]—and that is why the sum above is over [math]\displaystyle{ i \neq j }[/math]— while if there is no path connecting [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math], [math]\displaystyle{ d_{ij} = \infty }[/math] and their pairwise efficiency is zero. Being [math]\displaystyle{ d_{ij} }[/math] a count, for [math]\displaystyle{ i \neq j }[/math] [math]\displaystyle{ d_{ij} \geq 1 }[/math] and so [math]\displaystyle{ E(G) }[/math] is bounded between 0 and 1, i.e. it is a normalised descriptor.

Weighted networks

The shortest path distance can also be generalised to weighted networks, see the weighted shortest path distance, but in this case [math]\displaystyle{ d^W_{ij} \in [0, +\infty] }[/math] and the average communication efficiency needs to be properly normalised in order to be comparable among different networks.^[2][3]

In ^[1][2] the authors proposed to normalise [math]\displaystyle{ E(G) }[/math] dividing it by the efficiency of an idealised version of the network [math]\displaystyle{ G }[/math]:

[math]\displaystyle{ E_{\text{glob}}(G) = \frac{E(G)}{E(G^{\text{ideal}})}. }[/math]

[math]\displaystyle{ G^{\text{ideal}} }[/math] is the "ideal" graph on [math]\displaystyle{ N }[/math] nodes wherein all possible edges are present. In the unweighted case every edge has unitary weight, [math]\displaystyle{ G^{\text{ideal}} }[/math] is a clique, a full network, and [math]\displaystyle{ E(G^{\text{ideal}})= 1 }[/math]. When the edges are weighted, a sufficient condition (for having a proper normalisation, i.e. [math]\displaystyle{ E_{\text{glob}}(G) \in [0, 1] }[/math]) on the distances in the ideal network, called this time [math]\displaystyle{ l_{ij} }[/math], is ^[1][2]

[math]\displaystyle{ l_{ij} \leq d_{ij} }[/math]

for [math]\displaystyle{ i, j = 1, ..., N }[/math]. [math]\displaystyle{ l_{ij} }[/math] should be known (and different from zero) for all node pairs. A common choice is to take them as the geographical or physical distances in spatial networks^[2] or as the maximum cost over all links, e.g. [math]\displaystyle{ l_{ij} = \frac{1}{w_{\max }} }[/math] where [math]\displaystyle{ w_{\max } }[/math] indicates the maximum interaction strength in the network.^[4] However, in ^[3] the authors highlight the issues of these choices when dealing with real world networks, which are characterised by heterogeneous structure and flows. For instance, choosing [math]\displaystyle{ l_{ij} = \frac{1}{w_{\max }} }[/math] makes the global measure very sensitive to outliers in the distribution of weights and tends to under-estimate the actual efficiency of a network. The authors also propose a normalising procedure, i.e. a way for building [math]\displaystyle{ G^{\text{ideal}} }[/math] using all and only the information contained in the edge weights (and no other meta-data such as geographical distances), which is statistically robust and physically grounded.

Efficiency and small-world behaviour

The global efficiency of a network is a measure comparable to [math]\displaystyle{ 1/L }[/math], rather than just the average path length [math]\displaystyle{ L }[/math] itself. The key distinction is that, while [math]\displaystyle{ 1/L }[/math] measures efficiency in a system where only one packet of information is being moved through the network, [math]\displaystyle{ E_{\text{glob}}(G) }[/math] measures the efficiency of parallel communication, that is when all the nodes are exchanging packets of information with each other concurrently.

A local average of pairwise communication efficiencies can be used as an alternative to the clustering coefficient of a network. The local efficiency of a network [math]\displaystyle{ G }[/math] is defined as:

[math]\displaystyle{ E_{loc}(G, i) = \frac{1}{N} \sum_{i \in G} E(G_i) }[/math]

where [math]\displaystyle{ G_i }[/math] is the local subgraph consisting only of a node [math]\displaystyle{ i }[/math]'s immediate neighbors, but not the node [math]\displaystyle{ i }[/math] itself.

Applications

Broadly speaking, the efficiency of a network can be used to quantify small world behavior in networks. Efficiency can also be used to determine cost-effective structures in weighted and unweighted networks.^[2] Comparing the two measures of efficiency in a network to a random network of the same size to see how economically a network is constructed. Furthermore, global efficiency is easier to use numerically than its counterpart, path length.^[5]

For these reasons the concept of efficiency has been used across the many diverse applications of network science.^{[2] [6]} Efficiency is useful in analysis of man-made networks such as transportation networks and communications networks. It is used to help determine how cost-efficient a particular network construction is, as well as how fault tolerant it is. Studies of such networks reveal that they tend to have high global efficiency, implying good use of resources, but low local efficiency. This is because, for example, a subway network is not closed, and passengers can be re-routed, by buses for example, even if a particular line in the network is down.^[1]

Beyond human constructed networks, efficiency is a useful metric when talking about physical biological networks. In any facet of biology, the scarcity of resource plays a key role, and biological networks are no exception. Efficiency is used in neuroscience to discuss information transfer across neural networks, where the physical space and resource constraints are a major factor.^[5] Efficiency has also been used in the study of ant colony tunnel systems, which are usually composed of large rooms as well as many sprawling tunnels.^[7] This application to ant colonies is not too surprising because the large structure of a colony must serve as a transportation network for various resources, most namely food.^[6]

References

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Efficiency (network science). Read more