Homophily and long-run integration in social networks
We model network formation when heterogeneous nodes enter sequentially and form connections through both random meetings and network-based search, but with type-dependent biases. We show that there is “long-run integration”, whereby the composition of types in sufficiently old nodesʼ neighborhoods approaches the global type-distribution, provided that the network-based search is unbiased. However, younger nodesʼ connections still reflect the biased meetings process. We derive the type-based degree distributions and group-level homophily patterns when there are two types and location-based biases. Finally, we illustrate aspects of the model with an empirical application to data on citations in physics journals.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:147:y:2012:i:5:p:1754-1786. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.