🔖 Zipf’s, Heaps’ and Taylor’s laws are determined by the expansion into the adjacent possible

Zipf's, Heaps' and Taylor's laws are ubiquitous in many different systems where innovation processes are at play. Together, they represent a compelling set of stylized facts regarding the overall statistics, the innovation rate and the scaling of fluctuations for systems as diverse as written texts and cities, ecological systems and stock markets. Many modeling schemes have been proposed in literature to explain those laws, but only recently a modeling framework has been introduced that accounts for the emergence of those laws without deducing the emergence of one of the laws from the others or without ad hoc assumptions. This modeling framework is based on the concept of adjacent possible space and its key feature of being dynamically restructured while its boundaries get explored, i.e., conditional to the occurrence of novel events. Here, we illustrate this approach and show how this simple modelling framework, instantiated through a modified Polya's urn model, is able reproduce Zipf's, Heaps' and Taylor's laws within a unique self-consistent scheme. In addition the same modelling scheme embraces other less common evolutionary laws (Hoppe's model and Dirichlet processes) as particular cases.

Your email address will not be published. Required fields are marked *

Comment

Name *

Email *

Website

Notify me of follow-up comments by email.

Notify me of new posts by email.

To respond on your own website, enter the URL of your response which should contain a link to this post's permalink URL. Your response will then appear (possibly after moderation) on this page. Want to update or remove your response? Update or delete your post and re-enter your post's URL again. (Learn More)

Upcoming Events

MATH X 451.46: Introduction to Combinatorial AnalysisSeptember 24, 2019 at 7:00 pm – 10:00 pmUniversity of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USAhttps://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial AnalysisOctober 1, 2019 at 7:00 pm – 10:00 pmUniversity of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USAhttps://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial AnalysisOctober 8, 2019 at 7:00 pm – 10:00 pmUniversity of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USAhttps://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial AnalysisOctober 15, 2019 at 7:00 pm – 10:00 pmUniversity of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USAhttps://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…