Ranking-based rich-get-richer processes

From MaRDI portal
Publication:6138904

DOI10.1214/22-AAP1921arXiv1910.01066OpenAlexW3013697652MaRDI QIDQ6138904FDOQ6138904

Alexandros Gelastopoulos, Pantelis P. Analytis, Hrvoje Stojić

Publication date: 16 January 2024

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We study a discrete-time Markov process XninmathbbRd, 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 Xn / n. We characterize the possible limits if one is free to choose the initial state, and give a condition under which the initial state is irrelevant. Finally, we show how our framework can account for ranking-based P'olya urns and can be used to study ranking-algorithms for web interfaces.


Full work available at URL: https://arxiv.org/abs/1910.01066







Cites Work






This page was built for publication: Ranking-based rich-get-richer processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138904)