ZD_4_11

ZD_4_11 — Social Network Analysis — Granovetter, Small Worlds, Influence

Verified (Tier 1)
Confidence: 4/5 Section: ZD Updated: March 10, 2026
Source Count: 13 | Weighted Score: 33 | Source Confidence: [4/5] | Primary Tier: 1 | Last Updated: March 10, 2026
Keywords: social network analysis, network science, Granovetter, weak ties, small world, Watts, Strogatz, Milgram, six degrees, Barabási, scale-free, centrality, homophily, diffusion, influence, contagion, community detection, graph theory, triadic closure, structural holes, Burt
Category Tags: information computation, social network analysis, network science, sociology
Cross-References: ZD_4_06 — Network Theory · ZC_1_06 — Social Theory · G_2_05 — Systems Theory · T_1_01 — Psychology Social Overview

QUICK SUMMARY

Social network analysis (SNA) — the study of social structures through the use of graph theory and network science, where individuals (or organizations, nations, etc.) are represented as nodes and their relationships (friendship, communication, trade, influence, kinship) as edges — has become one of the most productive interdisciplinary research programs in the social sciences, revealing how the structure of social connections shapes individual behavior, information flow, power dynamics, disease transmission, and collective outcomes in ways that cannot be understood from individual attributes alone. Several landmark concepts and findings define the field: (1) The strength of weak tiesMark Granovetter (1973, American Journal of Sociology) demonstrated one of sociology's most cited insights: "weak ties" (acquaintances, infrequent contacts) are more valuable for accessing novel information, job opportunities, and diverse social worlds than "strong ties" (close friends, family) — because strong ties tend to form closed clusters of similar people (all know each other and share the same information), while weak ties act as bridges between otherwise disconnected clusters, providing access to information and resources circulating in distant parts of the network; Granovetter showed empirically that most people who found jobs through personal contacts found them through weak ties, not close friends. (2) Small-world networksStanley Milgram (1967) devised the famous "small-world experiment" (sending letters through chains of acquaintances from Nebraska to a target person in Massachusetts), finding that the median chain length was approximately six — giving rise to the popular concept of "six degrees of separation." Watts & Strogatz (1998, Nature) provided the mathematical framework: a small-world network is characterized by (a) high clustering (my friends tend to be friends with each other — triadic closure) and (b) short average path length (any two nodes are connected by a surprisingly small number of steps) — these two properties coexist because a small number of random long-range connections ("shortcuts") dramatically reduce path lengths while preserving local clustering. Many real social, biological, and technological networks exhibit small-world properties. (3) Scale-free networks and preferential attachmentBarabási & Albert (1999, Science) showed that many real networks have degree distributions following a power law ($P(k) \sim k^{-\gamma}$, typically $2 < \gamma < 3$), meaning a few highly connected hubs coexist with many weakly connected nodes; they proposed preferential attachment ("the rich get richer") as the mechanism: new nodes are more likely to connect to already well-connected nodes; scale-free networks are robust to random failures (removing random nodes has little effect) but vulnerable to targeted attacks on hubs. (4) Structural holesRonald Burt (1992, Structural Holes) extended Granovetter by identifying the strategic advantage of occupying brokerage positions — sitting between disconnected groups (filling a "structural hole"); individuals in brokerage positions have early access to diverse information, control information flow, and gain competitive advantages in organizations. (5) Centrality measures quantify the importance of nodes: degree centrality (number of connections), betweenness centrality (frequency of appearing on shortest paths — measuring brokerage), closeness centrality (average distance to all other nodes — measuring reachability), eigenvector centrality (connections weighted by the importance of connected nodes — the basis for Google's PageRank). (6) Network dynamicshomophily ("birds of a feather flock together" — McPherson, Smith-Lovin & Cook 2001) is the strongest organizing principle in social networks: people form ties with others who are similar in race, education, age, religion, occupation; the question of whether behavioral similarity among connected people is due to influence (peers shape your behavior) or selection (you choose peers who are already similar) is a central methodological challenge. Christakis & Fowler (2007, NEJM) found that obesity, smoking, and happiness appeared to spread through social networks (up to three degrees of separation), suggesting network effects on health behaviors — though the causal interpretation has been debated (Shalizi & Thomas 2011 argued that shared environments and latent homophily can produce similar patterns without genuine contagion). Modern SNA has been transformed by digital trace data — social media platforms, email, phone records, and online interactions provide unprecedented network data at scale, raising new questions about privacy, algorithmic influence, filter bubbles, and the relationship between online and offline social structures.


1. VERIFIED CLAIMS (Tier 1 — Empirical / Peer-Reviewed / Foundational)

1.1 Strength of Weak Ties

1.2 Small-World Networks

1.3 Scale-Free Networks


2. CREDIBLE CLAIMS (Tier 2 — Academic / Debated but Supported)

2.1 Network Contagion and Health

2.2 Structural Holes and Social Capital


3. SPECULATIVE CLAIMS (Tier 3 — Possible but Unverified)

3.1 Dunbar's Number and Online Networks


4. DUBIOUS CLAIMS (Tier 4 — No Credible Source / Contradicted by Evidence)

4.1 "Six Degrees" Is an Exact Universal Constant


COUNTER-ARGUMENTS


IMAGES

#DescriptionFilenameSourceLicense

No images assigned yet.


BIBLIOGRAPHY

  1. Granovetter, M.S | 1973 | "The Strength of Weak Ties" | American Journal of Sociology | ∅ | 78.6::1360–1380 | ∅ | ∅ | doi:10.1086/225469 | ∅ | ∅ | ∅
  2. Watts, D.J.; Strogatz, S.H | 1998 | "Collective Dynamics of 'Small-World' Networks" | Nature | ∅ | 393.6684::440–442 | ∅ | ∅ | doi:10.1038/30918 | ∅ | ∅ | ∅
  3. Barabási, A.-L.; Albert, R | 1999 | "Emergence of Scaling in Random Networks" | Science | ∅ | 286.5439::509–512 | ∅ | ∅ | doi:10.1126/science.286.5439.509 | ∅ | ∅ | ∅
  4. Burt, R.S | 1992 | ∅ | Structural Holes: The Social Structure of Competition | ∅ | ∅ | Cambridge, MA: Harvard University Press | ∅ | ∅ | ∅ | ∅ | ∅
  5. Milgram, S | 1967 | "The Small-World Problem" | Psychology Today | ∅ | 1.1::61–67 | ∅ | ∅ | ∅ | ∅ | ∅ | ∅
  6. Christakis, N.A.; Fowler, J.H | 2007 | "The Spread of Obesity in a Large Social Network over 32 Years" | New England Journal of Medicine | ∅ | 357.4::370–379 | ∅ | ∅ | doi:10.1056/NEJMsa066082 | ∅ | ∅ | ∅
  7. McPherson, M., Smith-Lovin, L.; Cook, J.M | 2001 | "Birds of a Feather: Homophily in Social Networks" | Annual Review of Sociology | ∅ | 27::415–444 | ∅ | ∅ | doi:10.1146/annurev.soc.27.1.415 | ∅ | ∅ | ∅
  8. Shalizi, C.R.; Thomas, A.C | 2011 | "Homophily and Contagion Are Generically Confounded in Observational Social Network Studies" | Sociological Methods & Research | ∅ | 40.2::211–239 | ∅ | ∅ | doi:10.1177/0049124111404820 | ∅ | ∅ | ∅
  9. Newman, M.E.J | 2010 | ∅ | Networks: An Introduction | ∅ | ∅ | Oxford: Oxford University Press | ∅ | ∅ | ∅ | ∅ | ∅
  10. Borgatti, S.P., Mehra, A., Brass, D.J.; Labianca, G | 2009 | "Network Analysis in the Social Sciences" | Science | ∅ | 323.5916::892–895 | ∅ | ∅ | doi:10.1126/science.1165821 | ∅ | ∅ | ∅
  11. Broido, A.D.; Clauset, A | 2019 | "Scale-Free Networks Are Rare" | Nature Communications | ∅ | 10.1::1017 | ∅ | ∅ | doi:10.1038/s41467-019-08746-5 | ∅ | ∅ | ∅
  12. Centola, D | 2010 | "The Spread of Behavior in an Online Social Network Experiment" | Science | ∅ | 329.5996::1194–1197 | ∅ | ∅ | doi:10.1126/science.1185231 | ∅ | ∅ | ∅
  13. Easley, D.; Kleinberg, J | 2010 | ∅ | Networks, Crowds, and Markets: Reasoning About a Highly Connected World | ∅ | ∅ | Cambridge: Cambridge University Press | ∅ | ∅ | ∅ | ∅ | ∅

CROSS-REFERENCE INDEX

Related DocConnection

No cross-references yet.


<table border="1" cellpadding="12" cellspacing="0" style="border-collapse: collapse; border: 2px solid #888; margin-top: 2em; background: #fafafa;">

<tr><td>

⚠️ AI-Assisted Research Disclaimer

This document was generated and structured with the assistance of AI tools.

While every effort is made to ensure accuracy, AI-assisted content may

contain errors, misattributions, or unintended inaccuracies. **Always

verify claims, dates, and sources independently** before citing or relying

on any information presented here.

are checked by automated systems, but mistakes can occur. If something

looks wrong, it may be.

uses a four-tier evidence system:

alternative, and skeptical viewpoints are presented side by side for

critical comparison, not endorsement. Inclusion does not imply agreement.

and bibliography enrichment are ongoing. Each revision adds stronger

citations, corrects identified errors, and expands coverage.

📖 For full details on our verification methodology, scoring systems, and

quality metrics, see: Fact-Checking & Verification Systems

Think Openly. Check the sources. Draw your own conclusions.

</td></tr>

</table>