Abstract
We study a discrete-time Markov process for which the distribution of the future increments depends only on the relative ranking of its components (descending order by value). We endow the process with a rich-get-richer assumption and show that, together with a finite second moments assumption, it is enough to guarantee almost sure convergence of . We characterize the possible limits if one is free to choose the initial state and we give a condition under which the initial state is irrelevant. Finally, we show how our framework can account for ranking-based Pólya urns and can be used to study ranking algorithms for web interfaces.
Funding Statement
Pantelis P. Analytis was supported in part through NSF Award IIS-1513692 granted to Thorsten Joachims.
Acknowledgments
We would like to thank Thorsten Joachims, Gabor Lugosi, and Murad Taqqu for their remarks in previous versions of this manuscript.
Citation
Pantelis P. Analytis. Alexandros Gelastopoulos. Hrvoje Stojic. "Ranking-based rich-get-richer processes." Ann. Appl. Probab. 33 (6A) 4366 - 4394, December 2023. https://doi.org/10.1214/22-AAP1921
Information