families of entropic vectors. For both families of entropic vectors, the $\mathcal{K}_{M}$ region shrinks as the information redundancy increases. That is, when agents share more information in common, the NE network connectivity becomes less “uncertain" since the $\mathcal{K}_{M}$ region (which is the only region with potentially multiple equilibria with different levels of connectivity) in this case will correspond to a limited range of link costs. Moreover, we note that for the first family of entropic vectors, when agents 2 and 3 information are fully redundant (i.e. $\mbox{KL}(\mathcal{X}) = 4$), we have a sharp threshold on the link cost, below which we have a connected network, and above which we have a fully disconnected network (i.e. the $\mathcal{K}_{M}$ region is empty). The intuition behind this is that since agents 2 and 3 are fully “correlated", they only benefit from connecting to agent 1. Thus, agent 1 acts as the only information source, and it is the benefit from getting agent’s 1 information that solely determines the cost at which the network would be connected or not. If agents 2 and 3 information are not redundant, they add value to the network, and the cost thresholds become dependent on their information as 