K-clique percolation in free association networks. The mechanism behind the 7 ± 2 law?
preprint
OA: closed
Abstract
It is important to reveal the mechanisms of propagation in different cognitive networks. In this study we discuss the k-clique percolation phenomenon on the free association networks including "English Small World of Words project" (SWOW-EN). We compare different semantic networks and networks of free associations for different languages. Surprisingly it turned out that k-clique percolation for all k < k c = (6 − 7) is possible on free association networks of different languages. Our analysis suggests the new universality patterns for a community organization of free association networks. We conjecture that our result can provide the qualitative explanation of the Miller’s 7 ± 2 rule for the capacity limit of working memory. The new model of network evolution extending the preferential attachment is suggested which provides the observed value of k c .
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00