The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Meeting Strangers and Friends of Friends: How Random Are Social Networks?
Abstract
We present a dynamic model of network formation where nodes find other nodes with whom to form links in two ways: some are found uniformly at random, while others are found by searching locally through the current structure of the network (e.g., meeting friends of friends). This combination of meeting processes results in a spectrum of features exhibited by large social networks, including the presence of more high- and low-degree nodes than when links are formed independently at random, having low distances between nodes in the network, and having high clustering of links on a local level. We fit the model to data from six networks and impute the relative ratio of random to network-based meetings in link formation, which turns out to vary dramatically across applications. We show that as the random/network-based meeting ratio varies, the resulting degree distributions can be ordered in the sense of stochastic dominance, which allows us to infer how the formation process affects average utility in the network. (JEL D85, Z13)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,961
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Increasing risk: I. A definition
Rothschild, M., & Stiglitz, J. E. (1970) · Journal of Economic Theory · doi:10.1016/0022-0531(70)90038-4 · Cited by 3,829
Price, D. J. D. S. (1965) · Science · doi:10.1126/science.149.3683.510 · Cited by 3,122
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
A Strategic Model of Social and Economic Networks
Jackson, M. O., & Wolinsky, A. (1996) · Journal of Economic Theory · doi:10.1006/jeth.1996.0108 · Cited by 2,588
Self-citationMean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Zipf's Law for Cities: An Explanation
Gabaix, X. (1999) · The Quarterly Journal of Economics · doi:10.1162/003355399556133 · Cited by 2,039
A general theory of bibliometric and other cumulative advantage processes
Price, D. D. S. (1976) · Journal of the American Society for Information Science · doi:10.1002/asi.4630270505 · Cited by 2,035
Coauthorship networks and patterns of scientific collaboration
Newman, M. E. J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307545100 · Cited by 1,931
Pareto, V. (1964) · Librairie Droz eBooks · doi:10.3917/droz.paret.1964.01 · Cited by 1,772
II.—A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis, F. R. S
Yule, G. U. (1925) · Philosophical Transactions of the Royal Society of London. Series B, Containing Papers of a Biological Character · doi:10.1098/rstb.1925.0002 · Cited by 1,718
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-L., Albert, R., & Jeong, H. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,408
A Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
Random difference equations and Renewal theory for products of random matrices
Kesten, H. (1973) · Acta Mathematica · doi:10.1007/bf02392040 · Cited by 989
Chains of affection: the structure of adolescent romantic and sexual networks
Bearman, P. S., Moody, J., & Stovel, K. (2004) · American Journal of Sociology · doi:10.1086/386272 · Cited by 817
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G. (2001) · Random Structures & Algorithms · doi:10.1002/rsa.1009 · Cited by 804
Eeckhout, J. (2004) · American Economic Review · doi:10.1257/0002828043052303 · Cited by 778
Peer Effects and Social Networks in Education
CALVÓ-ARMENGOL, A., PATACCHINI, E., & ZENOU, Y. (2009) · Review of Economic Studies · doi:10.1111/j.1467-937x.2009.00550.x · Cited by 773
Bayesian Learning in Social Networks
Acemoglu, D., Dahleh, M. A., Lobel, I., & Ozdaglar, A. (2011) · The Review of Economic Studies · doi:10.1093/restud/rdr004 · Cited by 754
Stochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
Gell‐Mann, M. (1998) · APS Texas Sections Fall Meeting Abstracts · Cited by 669
The Diameter of a Scale-Free Random Graph
Bollob�s*, B., & Riordan, O. (2004) · Combinatorica · doi:10.1007/s00493-004-0002-2 · Cited by 594
Vázquez, A. (2003) · Physical Review E · doi:10.1103/physreve.67.056104 · Cited by 563
Highly optimized tolerance: A mechanism for power laws in designed systems
Carlson, J. M., & Doyle, J. (1999) · Physical Review E · doi:10.1103/physreve.60.1412 · Cited by 549
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C. H., & Shenker, S. J. (2003) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/872035.872088 · Cited by 523
Winners don't take all: Characterizing the competition for links on the web
Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., & Giles, C. L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032085699 · Cited by 455
Economics : an emerging small world?
Moraga‐González, J. L., van der Leij, M., & Goyal, S. (2004) · Econstor (Econstor) · Cited by 453
Are randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Informant Accuracy in Social Network Data
Killworth, P., & Bernard, H. (1976) · Human Organization · doi:10.17730/humo.35.3.10215j2m359266n2 · Cited by 422
Adamic, L. A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48155-9_27 · Cited by 405
Highly clustered scale-free networks
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.036123 · Cited by 395
A Survey of Models of Network Formation: Stability and Efficiency
Jackson, M. O. (2003) · CaltechAUTHORS (California Institute of Technology) · doi:10.7907/c4y9t-bg336 · Cited by 374
Self-citationCooper, C., & Frieze, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10084 · Cited by 344
Growing scale-free networks with small-world behavior
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.057102 · Cited by 339
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
Fabrikant, A., Koutsoupias, E., & Papadimitriou, C. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_11 · Cited by 310
The Economics of Social Networks
Jackson, M. O. (2013) · Advances in Economics and Econometrics · doi:10.1017/cbo9781139052269.003 · Cited by 264
Self-citationScaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
On the Mechanics of Firm Growth
Luttmer, E. G. J. (2011) · The Review of Economic Studies · doi:10.1093/restud/rdq028 · Cited by 192
Goeree, J. K., McConnell, M. A., Mitchell, T., Tromp, T. K., & Yariv, L. (2010) · American Economic Journal Microeconomics · doi:10.1257/mic.2.1.183 · Cited by 158
Direct Factor Analysis of Sociometric Data
MacRae, D. E. (1960) · Sociometry · doi:10.2307/2785690 · Cited by 138
Marcel Fafchamps, A., van der Leij, M., & Goyal, S. (2010) · Journal of the European Economic Association · doi:10.1111/j.1542-4774.2010.tb00500.x · Cited by 126
Networks and Economic Behavior
Jackson, M. O. (2009) · Annual Review of Economics · doi:10.1146/annurev.economics.050708.143238 · Cited by 93
Self-citationA statistical physics perspective on Web growth
Krapivsky, P. L., & Redner, S. (2002) · Computer Networks · doi:10.1016/s1389-1286(02)00212-8 · Cited by 75
A stochastic model for the evolution of the Web
Mark Levene, A., Fenner, T. I., Loizou, G. D., & Wheeldon, R. (2002) · Computer Networks · doi:10.1016/s1389-1286(02)00209-8 · Cited by 61
Read, C. B. (2005) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess2981.pub2 · Cited by 59
'Collective Innovation’ in a Model of Network Formation with Preferential Meeting
Φ, N. C., & Roux, P. (2005) · Lecture notes in economics and mathematical systems · doi:10.1007/3-540-27296-8_10 · Cited by 25
Pin, P. (2010) · Research in Economics · doi:10.1016/j.rie.2010.11.003 · Cited by 8
(1949) · Max Planck Digital Library
Cited by
Introduction to stochastic actor-based models for network dynamics
Snijders, T. A. B., van de Bunt, G. G., & Steglich, C. E. G. (2010) · Social Networks · doi:10.1016/j.socnet.2009.02.004 · Cited by 2,103
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Broido, A. D., & Clauset, A. (2019) · Nature Communications · doi:10.1038/s41467-019-08746-5 · Cited by 875
The Genesis and Dynamics of Organizational Networks
Ahuja, G., Soda, G., & Zaheer, A. (2012) · Organization Science · doi:10.1287/orsc.1110.0695 · Cited by 874
Peer Effects and Social Networks in Education
CALVÓ-ARMENGOL, A., PATACCHINI, E., & ZENOU, Y. (2009) · Review of Economic Studies · doi:10.1111/j.1467-937x.2009.00550.x · Cited by 773
Metadata
- Authors
- Jackson, M. O., & Rogers, B. W.
- Venue
- American Economic Review
- Publisher
- American Economic Association
- Published
- 2007-05-01
- Volume
- 97
- Issue
- 3
- Pages
- 890-915
- ISSN
- 0002-8282 (ISSN-L)
- OpenAlex
- W2001550906
- Cited by
- 633
- References
- 56
- FWCI
- 20.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.