HackerPapers

arXiv:1407.2775physics.soc-ph

Understanding scaling through history-dependent processes with collapsing sample space

Bernat Corominas-Murtra, Rudolf Hanel, Stefan Thurner

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

History-dependent processes are ubiquitous in natural and social systems. Many such stochastic processes, especially those that are associated with complex systems, become more constrained as they unfold, meaning that their sample-space, or their set of possible outcomes, reduces as they age. We demonstrate that these sample-space reducing (SSR) processes necessarily lead to Zipf's law in the rank distributions of their outcomes. We show that by adding noise to SSR processes the corresponding rank distributions remain exact power-laws, $p(x)\sim x^{-λ}$, where the exponent directly corresponds to the mixing ratio of the SSR process and noise. This allows us to give a precise meaning to the scaling exponent in terms of the degree to how much a given process reduces its sample-space as it unfolds. Noisy SSR processes further allow us to explain a wide range of scaling exponents in frequency distributions ranging from $α= 2$ to $\infty$. We discuss several applications showing how SSR processes can be used to understand Zipf's law in word frequencies, and how they are related to diffusion processes in directed networks, or ageing processes such as in fragmentation processes. SSR processes provide a new alternative to understand the origin of scaling in complex systems without the recourse to multiplicative, preferential, or self-organised critical processes.

arXiv comments
7 pages, 5 figures in Proceedings of the National Academy of Sciences USA (published ahead of print April 13, 2015)
Journal reference
DOI
doi:10.1073/pnas.1420946112
Subjects
physics.soc-phPhysics and Society cond-mat.stat-mechStatistical Mechanics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2025 to Nov 2025.

Comments linking this paper, per year.

Discussed in comments1 thread

    • On a related note I wrote a few “poems” using anagrams. The principle is simple: take a short phrase and have each line in the poem be an anagram of it. You can’t do this with just any phrase; the letters need to be reasonably well balanced for the target language so you can…

      Xmd5aView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.