Greedy algorithms and Zipf laws
From MaRDI portal
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 items out of , the agent originally in A moves to B. We solve the model analytically in the cases and . The resulting stationary distribution of sizes is generically a Zipf-law provided . When , no selection occurs and the size distribution remains thin-tailed. In the special case , one needs to regularise the problem by introducing a small "default" probability . We find that the stationary distribution has a power-law tail that becomes a Zipf-law when . The approach to the stationary state can also been characterized, with strong similarities with a simple "aging" model considered by Barrat & M'ezard.
Recommendations
- scientific article; zbMATH DE number 1146090
- Greedy in Approximation Algorithms
- A class of greedy algorithms and its relation to greedoids
- Some remarks on greedy algorithms
- scientific article; zbMATH DE number 1191608
- scientific article; zbMATH DE number 3970528
- The classification of greedy algorithms
- Greedy algorithms with prescribed coefficients
- Canonical greedy algorithms and dynamic programming
Cites work
Cited in
(5)
This page was built for publication: Greedy algorithms and Zipf laws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964565)