as many individuals, linked among them by $8$ identical purchase choices (namely the purchase of the same goods or services) represented by as many links. In such setting, information spans from node to node, within the network, via the links’ pattern [@bakshy2012role; @galati2019framework].

It is worth mentioning that, according to the literature, both the word “network” and “graph” can be used interchangeably. While the first is generally associated to real systems, such as the WWW or networks of individuals, “graph” is mainly used to analyse the mathematical representation of a network [pag. 45, @barabasi2016network].

We refer to a node by an index $i$, meaning that we allow a one-to-one correspondence between an index in $\{1, \ldots, N\}$ and a node in $V$. The set $E$ can be conceptualised through the adjacency matrix $A = (a_{ij})_{i, j=1, \ldots, N}$, whose generic element $a_{ij}$ is equivalent to $1$ – if the link between $i$ and $j$ exists – or, otherwise, to $0$.

In this paper, we examine undirected and unweighted networks, thus $a_{ij} = a_{ji}$, for each $i, j = 1, \ldots, N$. In other words, considering the previous graph in Figure \[fig:1\], the index represents the identification number of a generic 