Optimization mechanism

Network science algorithm

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Optimization mechanism" – news · newspapers · books · scholar · JSTOR (August 2014) (Learn how and when to remove this message)

|

In network science, the optimization mechanism is a network growth algorithm, which randomly places new nodes in the system, and connects them to the existing nodes based on a cost-benefit analysis. Depending on the parameters used in the optimization mechanism, the algorithm can build three types of networks: a star network, a random network, and a scale-free network. Optimization mechanism[1] is thought to be the underlying mechanism in several real networks, such as transportation networks, power grid, router networks, the network of highways, etc.

## General Properties

[edit]

The optimization mechanism is a model with growth, in which preferential attachment is valid under certain assumptions. As opposed to the copying model, the optimization model uses global information about the network, to connect the newly entering nodes to the existing ones, thus reducing the amount of randomness in the process. The model's mechanism is based on a cost-benefit comparison, that is for each entering node 'i', the algorithm calculates the net benefit (benefits minus costs) of connecting 'i' to each existing node, and connects node 'i' to the node which gives the highest net benefit.[2]

## Description

[edit]

The costs and benefits in the optimization models can generally be simplified into two attributes: the distance between the new node, and the existing one; and the distance of the existing node from the central node. Thus the goal function can be written in the following form:

C i = m i n j [ δ ∗ d i j + h j ] {\displaystyle C_{i}=min_{j}[\delta *d_{ij}+h_{j}]}

* where  C i {\displaystyle C_{i}} stands for the minimal cost of attaching node 'i' to an existing node
* d i j {\displaystyle d_{ij}} denotes the distance between node 'i' and 'j'
* h j {\displaystyle h_{j}} represents the distance of node 'j' from the central node
* δ {\displaystyle \delta } is a parameter, that determines the weight of the individual distance compared to the distance to the central node, and thus it varies across different settings.

In a highway network setting - where cities are nodes and links are highways -  d i j {\displaystyle d_{ij}} would be the physical distance between cities, and  h j {\displaystyle h_{j}} would be the distance from the capital (or from the central city of the region). The value of  δ {\displaystyle \delta } determines the type of the network built by the optimization mechanism.[2]

### Star Network

[edit]

The optimization mechanism results in a star network, whenever  δ < ( 1 / 2 ) 1 / 2 {\displaystyle \delta <(1/2)^{1/2}} . A unique feature of the star network is that most of the newly added nodes will connect to the central node regardless of the distance. One can think of a star network as a network in which the costs to establish a new link are negligible compared to the benefit of being directly connected to the central node. Star networks are rarely observed in reality.

### Random Network

[edit]

A random network is built using the optimization method when  δ > N 1 / 2 {\displaystyle \delta >N^{1/2}} . In case of a high enough  δ {\displaystyle \delta } , the costs to establish a new link are enormously high, compared to the benefit of being closely connected to the central node. As a result, most of the new nodes will connect to the closest node available. A real life example is the power grid network, where the cost of building a power line is high, and the benefits of being directly connected to the power source is negligible.

### Scale-free Network

[edit]

4 < δ < N 1 / 2 {\displaystyle 4<\delta <N^{1/2}} . If  δ {\displaystyle \delta } is neither too high, nor too low, the mechanism results in a scale-free network, characterised by preferential attachment. The newly added nodes tend to connect to the larger nodes, but sometimes they may connect to middle-size nodes, or even small ones, depending on their distance. Most of the real-life networks characterized by an underlying optimization mechanism are scale-free networks, such as the router network and the highway network.

## References

[edit]

1. ^ Z. Kigrave, iBook, Page 136 (24 July 2017). "Optimization mechanism".`{{cite web}}`: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)
2. ^ a b The Network Science Book Project Archived 2015-01-18 at the Wayback Machine, iBook, Page 8