Greedy algorithms and Zipf laws
We consider a simple model of firm/city/etc growth based on a multi-item criterion: whenever entity B fares better than entity A on a subset of M items out of K, the agent originally in A moves to B. We solve the model analytically in the cases K = 1 and . The resulting stationary distribution of...
Main Authors: | Moran, J, Bouchaud, J-P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IOP Publishing
2018
|
Similar Items
-
Zipf’s law holds for phrases, not words
by: Ryland Williams, Jake, et al.
Published: (2015) -
The consequences of Zipf's law for syntax and symbolic reference.
by: i Cancho, R, et al.
Published: (2005) -
A Note of Zipf's Law, Natural Languages, and Noncoding DNA Regions
by: Niyogi, Partha, et al.
Published: (2004) -
On prefix codes satisfying RLL-constraint for Zipf distribution
by: Ho, Shaun
Published: (2020) -
Unravelling Greedy Algorithms
by: Bird, R
Published: (1992)