Ranking-based rich-get-richer processes (Q6138904)

In this work, the authors treated the problem in the context of (discrete-time) Markov processes, with the dynamics depending explicitly on the ranking. Specifically, they considered a nonhomogeneous random walk in \(R^d\), for which the distribution of the steps depends only on the ranking of its components (descending order of their values). Their results seems to strengthen one of the few known results for random walks in cones with possibly infinite exit time given by \textit{R. Garbit} and \textit{K. Raschel} [Rev. Mat. Iberoam. 32, No. 2, 511--532 (2016; Zbl 1346.60060)].