For sexually transmitted infections like HIV to propagate through a population, there must be a path linking susceptible cases to currently infectious cases. The existence of such paths depends in part on the degree distribution. Here, we use simulation methods to examine how two features of the degree distribution affect network connectivity: Mean degree captures a volume dimension, while the skewness of the upper tail captures a shape dimension. We find a clear interaction between shape and volume: When mean degree is low, connectivity is greater for long-tailed distributions, but at higher mean degree, connectivity is greater in short-tailed distributions. The phase transition to a giant component and giant bicomponent emerges as a positive function of volume, but it rises more sharply and ultimately reaches more people in short-tail distributions than in long-tail distributions. These findings suggest that any interventions should be attuned to how practices affect both the volume and shape of the degree distribution, noting potential unanticipated effects. For example, policies that primarily affect high-volume nodes may not be effective if they simply redistribute volume among lower degree actors, which appears to exacerbate underlying network connectivity.

As social networks evolve, new nodes are linked to the large-scale organization already in place. We show that the combination of two simple algorithms, one the Barabasi-Albert preferential attachment proposal and the other a neighbor attachment rule, successfully generate networks exhibiting both the local and global characteristics of empirical data on social network structures. Ideally, one might hope that some coarse features of this linking process and the form of the local patterns might enable the prediction of large-scale properties. We show that this is generally not the case. This might help explain the variety of local and global patterns in empirical networks.