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...
Главные авторы: | Moran, J, Bouchaud, J-P |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
IOP Publishing
2018
|
Схожие документы
-
Unzipping Zipf's law.
по: Sander Lestrade
Опубликовано: (2017-01-01) -
Dynamical approach to Zipf's law
по: Giordano De Marzo, и др.
Опубликовано: (2021-01-01) -
Snooker Statistics and Zipf’s Law
по: Wim Hordijk
Опубликовано: (2022-10-01) -
Territorial Planning and Zipf’s Law
по: Kabanov Vadim N.
Опубликовано: (2019-05-01) -
Bias in Zipf’s law estimators
по: Charlie Pilgrim, и др.
Опубликовано: (2021-08-01)