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...
Autores principales: | Moran, J, Bouchaud, J-P |
---|---|
Formato: | Journal article |
Lenguaje: | English |
Publicado: |
IOP Publishing
2018
|
Ejemplares similares
-
Unzipping Zipf's law.
por: Sander Lestrade
Publicado: (2017-01-01) -
Dynamical approach to Zipf's law
por: Giordano De Marzo, et al.
Publicado: (2021-01-01) -
Snooker Statistics and Zipf’s Law
por: Wim Hordijk
Publicado: (2022-10-01) -
Territorial Planning and Zipf’s Law
por: Kabanov Vadim N.
Publicado: (2019-05-01) -
Bias in Zipf’s law estimators
por: Charlie Pilgrim, et al.
Publicado: (2021-08-01)