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.)
|Date of creation:||Mar 2005|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: 626 395-4065
Fax: 626 405-9841
Web page: http://www.hss.caltech.edu/ss
|Order Information:|| Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Dunia López-Pintado, 2004.
"Diffusion In Complex Social Networks,"
Working Papers. Serie AD
2004-33, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
- Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006.
"Network formation with heterogeneous players,"
Games and Economic Behavior,
Elsevier, vol. 54(2), pages 353-372, February.
- Jackson, Matthew O. & Rogers, Brian W., 2005.
"The economics of small worlds,"
1214, California Institute of Technology, Division of the Humanities and Social Sciences.
- Matthew O. Jackson & Asher Wolinsky, 1995.
"A Strategic Model of Social and Economic Networks,"
1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Sanjeev Goyal & Marco J. van der Leij & Jos� Luis Moraga-Gonzalez, 2006.
"Economics: An Emerging Small World,"
Journal of Political Economy,
University of Chicago Press, vol. 114(2), pages 403-432, April.
- Sanjeev Goyal & Marco van der Leij & José Luis Moraga Gonzales, 2004. "Economics: An Emerging Small World?," CESifo Working Paper Series 1287, CESifo Group Munich.
- Sanjeev Goyal & Marco van der Leij & José Luis Moraga-Gonzàlez, 2004. "Economics: An Emerging Small World?," Working Papers 2004.84, Fondazione Eni Enrico Mattei.
- Xavier Gabaix, 1999. "Zipf'S Law For Cities: An Explanation," The Quarterly Journal of Economics, MIT Press, vol. 114(3), pages 739-767, August.
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
When requesting a correction, please mention this item's handle: RePEc:clt:sswopa:1216. 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: (Victoria Mason)
If references are entirely missing, you can add them using this form.