Estimating Personal Network Size with Non-random Mixing via Latent Kernels

By: Swupnil Sahai, Timothy Jones*, Sarah K. Cowan & Tian Zheng

Published in: Aiello L., Cherifi C., Cherifi H., Lambiotte R., Lió P., Rocha L. (eds) Complex Networks and Their Applications VII. Complex Networks 2018. Studies in Computational Intelligence, vol 812. Springer.

A major problem in the study of social networks is estimating the number of people an individual knows. However, there is no general method to account for barrier effects, a major source of bias in common estimation procedures. The literature describes approaches that model barrier effects, or non-random mixing, but they suffer from unstable estimates and fail to give results that agree with specialists’ knowledge. In this paper we introduce a model that builds off existing methods, imposes more structure, requires significantly fewer parameters, and yet allows for greater interpretability. We apply our model on responses gathered from a survey we designed and show that our conclusions better match what sociologists find in practice. We expect that this approach will provide more accurate estimates of personal network sizes and hence remove a significant hurdle in sociological research.