the light of such properties, also knowing a single node-related information, it is possible to acquire data on the neighbour nodes, hence about users with similar characteristics.

We start from the Metcalfe’s law which affirms that the value $\mathcal{V}$ of a network $G$ is proportional to the square of the nodes’ number, i.e. $\mathcal{V} \propto n^2$ [@gilder1993metcalfe]. Stemming from the ethernet network context, the Metcalfe’s law definition, considers all nodes as mutually linked[^21]. In general terms, networks are not densely connected, hence estimating the value of a network as $n(n - 1)$ seems to be unrealistic.

In our setting, considering how available information to the enterprise (or the platform) is given by the amounts of connections set present in a network, it is reasonable to think that all users are not mutually connected, nor are items, or users’ preferences in terms of goods or services. By means of the well known “handshaking lemma” [e.g. @bollobas2013modern p. 4], we obtain that the sum of all network’s degrees is equal to twice the numbers of links, i.e. $\sum_{i \in V} d_i = 2m$. With this setting, we can assume that the object shared in the network is the information patrimony $IP$, thus 