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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Meeting Strangers and Friends of Friends: How Random Are Social Networks? https://app.cochat.ai/papers/10.1257/aer.97.3.890
- The paper
- Jackson, M. O., & Rogers, B. W. (2007). Meeting Strangers and Friends of Friends: How Random Are Social Networks? American Economic Review. https://doi.org/10.1257/aer.97.3.890
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.