A phase transition for the strength of weak ties

Clicks: 12
ID: 333433
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #143 of 151 articles by views in PNAS nexus

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 151 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract Granovetter's ``strength of weak ties'' argument links local triadic closure to the global importance of weak relationships, but it does not by itself quantify when strong ties can or cannot sustain large-scale connectivity. We study the subgraph formed by strong ties under a uniform, edgewise closure condition. A strong-tie graph is called p-transitive when, for every ordered adjacent pair (A,B), at least a fraction p of the strong neighbors of B other than A are also strong neighbors of A. Under a fixed maximum-degree bound, we prove a sharp structural transition at p = 2/3. If p > 2/3, every strong-tie component has size bounded by an explicit function of p and the degree bounds, independently of the total network size. If p < 2/3, bounded-degree p-transitive graphs can have arbitrarily large connected strong-tie components. We also revisit three unweighted real-world networks by thresholding a Jaccard neighborhood-overlap proxy for tie strength and plotting global transitivity against normalized size-biased mean component size. These empirical curves show fragmentation as low-overlap edges are removed, but their statistic and thresholds are not the theorem's edgewise parameter. The theorem is therefore a conditional structural result, while the data illustrate a related clustering--connectivity tradeoff rather than a direct validation of the constant 2/3.
Reference Key
openalex_W7223209936 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Esha Chatterjee, Sourav Chatterjee
Are you one of these authors? Claim your profile
Journal PNAS nexus
Year 2026
DOI
10.1093/pnasnexus/pgag364
URL
https://doi.org/10.1093/pnasnexus/pgag364
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.