neighbour:

$$NIP_i \simeq \frac{d_i}{2m} + \frac{d_i}{2m} k_{nn} = \frac{d_i}{2m}(1 + k_{nn})$$

Finally, using Equation (\[neighbor\]) for $k_{nn}$ we obtain:

$$\label{CMS}
NIP_i = \frac{d_i}{2m}\bigg(1 +  \frac{\langle d^2\rangle}{\langle d\rangle}\bigg)$$

In Equation (\[CMS\]) we state that the neighbour information patrimony of a node $i$ is given by the value of its information patrimony, multiplied for a value which captures the level of connectedness given as an overall measure of the whole network. This represents a peculiar measure concerning the entire network $N$, defining what the information is worth within it. We call such measure $NIP_N$:

$$\label{netv}
NIP_N = \bigg(1 +  \frac{\langle d^2\rangle}{\langle d\rangle}\bigg)$$

Since ${\langle d^2\rangle}/{\langle d\rangle} > 0$ and, excluding network with all nodes with the same degree, we have that $NIP_N > 1$.

Please also note that in a complete network – where all nodes are connected to one another – the number of links equals $n(n-1)/2$, and for every node we obtain that $IP_i = 1/n$, while $NIP_i = 1$. Such results mean that if each node of a network is mutually connected to the others, then it possesses the whole network information patrimony[^22].

Correlated networks
-------------------

As a general case, taking into consideration equation (\[CMS1\]) we approximate the network 