Greedy algorithms and Zipf laws

Jos\'e Moran and Jean-Philippe Bouchaud

Papers from arXiv.org

Abstract: We consider a simple model of firm/city/etc. growth based on a multi-item criterion: whenever entity B fares better that 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 $K \to \infty$. The resulting stationary distribution of sizes is generically a Zipf-law provided $M > K/2$. When $M \leq K/2$, no selection occurs and the size distribution remains thin-tailed. In the special case $M=K$, one needs to regularise the problem by introducing a small "default" probability $\phi$. We find that the stationary distribution has a power-law tail that becomes a Zipf-law when $\phi \to 0$. The approach to the stationary state can also been characterized, with strong similarities with a simple "aging" model considered by Barrat & M\'ezard.

Date: 2018-01, Revised 2018-02
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/1801.05279 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1801.05279

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().