Hostname: page-component-77f85d65b8-5ngxj Total loading time: 0 Render date: 2026-04-17T18:14:54.043Z Has data issue: false hasContentIssue false

What problem does a fractal social network solve?

Published online by Cambridge University Press:  27 November 2025

Marcus J. Hamilton*
Affiliation:
Department of Anthropology, University of Texas at San Antonio , San Antonio, TX, USA School of Data Science, University of Texas at San Antonio, San Antonio, TX, USA Santa Fe Institute, Santa Fe, NM, USA marcus.hamilton@utsa.edu
*
*Corresponding author.

Abstract

Dunbar’s framework highlights the challenge of maintaining large, stable social networks given cognitive constraints. Expanding on this, I propose that fractal social networks function as lossy compression algorithms, efficiently reducing the complexity of social storage and retrieval. Rather than tracking all relationships explicitly, individuals rely on hierarchical abstractions and transitive inference, shifting storage complexity from $O\left( {{N^2}} \right)$ to $O\left( {N\log N} \right)$. This insight suggests broader implications for cognitive evolution, institutional organization, and artificial intelligence.

Information

Type
Open Peer Commentary
Copyright
© The Author(s), 2025. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable