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
-
Unzipping Zipf's law.
by: Sander Lestrade
Published: (2017-01-01) -
Dynamical approach to Zipf's law
by: Giordano De Marzo, et al.
Published: (2021-01-01) -
Snooker Statistics and Zipf’s Law
by: Wim Hordijk
Published: (2022-10-01) -
Territorial Planning and Zipf’s Law
by: Kabanov Vadim N.
Published: (2019-05-01) -
Bias in Zipf’s law estimators
by: Charlie Pilgrim, et al.
Published: (2021-08-01)