Search in the formation of large networks: How random are socially generated networks?

We present a model of network formation where entering nodes find other nodes to link to both completely at random and through search of the neighborhoods of these randomly met nodes. We show that this model exhibits the full spectrum of features that have been found to characterize large socially generated networks. Moreover, we derive the distribution of degree (number of links) across nodes, and show that while the upper tail of the distribution is approximately ``scale- free,'' the lower tail may exhibit substantial curvature, just as in observed networks. We then fit the model to data from six networks. Besides offering a close fit of these diverse networks, the model allows us to impute the relative importance of search versus random attachment in link formation. We find that the fitted ratio of random meetings to search-based meetings varies dramatically across these applications. Finally, we show that as this random/search ratio varies, the resulting degree distributions can be completely ordered in the sense of second order stochastic dominance. This allows us to infer how the relative randomness in the formation process affects average utility in the network.(This abstract was borrowed from another version of this item.)