Complete asymptotic type-token relationship for growing complex systems with inverse power-law count rankings

Abstract

The growth dynamics of complex systems often exhibit statistical regularities involving power-law relationships. For real finite complex systems formed by countable tokens (animals, words) as instances of distinct types (species, dictionary entries), an inverse power-law scaling $S\sim r^{-\alpha }$ between type count $S$ and type rank $r$, widely known as Zipf's law, is widely observed to varying degrees of fidelity. A secondary, summary relationship is Heaps' law, which states that the number of types scales sublinearly with the total number of observed tokens present in a growing system. Here, we propose an idealized model of a growing system that (1) deterministically produces arbitrary inverse power-law count rankings for types, and (2) allows us to determine the exact asymptotics of the type-token relationship. Our argument improves upon and remedies earlier work. We obtain a unified asymptotic expression for all values of $\alpha$, which corrects the special cases of $\alpha =1$ and $\alpha \gg 1$. Our approach relies solely on the form of count rankings, avoids unnecessary approximations, and does not involve any stochastic mechanisms or sampling processes. We thereby demonstrate that a general type-token relationship arises solely as a consequence of Zipf's law.

5 pages, 2 figures

References in corpus (8)

• Emergence of scaling in random networks
• Power laws, Pareto distributions and Zipf's law
• Topology of the World Trade Web
• Zipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size Systems
• Empirical Tests of Zipf's law Mechanism In Open Source Linux Distribution
• The meta book and size-dependent properties of written language
• Text mixing shapes the anatomy of rank-frequency distributions: A modern Zipfian mechanics for natural language
• On the emergence of Zipf's law in music