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 , 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 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
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Discrete-time Markov processes on general state spaces (60J05)
Cites Work
- Title not available (Why is that?)
- Emergence of Scaling in Random Networks
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Ordered random walks
- Random walks in cones
- A survey of random processes with reinforcement
- Polya Urn Models
- Title not available (Why is that?)
- Convergence rates for rank-based models with applications to portfolio theory
- One-dimensional Brownian particle systems with rank-dependent drifts
- Atlas models of equity markets
- Zipf's Law for Cities: An Explanation
- Hybrid Atlas models
- Random walks in cones: the case of nonzero drift
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- Oscillating Brownian motion
- Non-homogeneous random walks. Lyapunov function methods for near-critical stochastic systems
- Generalizations of Polya's urn problem
- A strong law for some generalized urn processes
- Estimation after adaptive allocation
- On a preferential attachment and generalized Pólya's urn model
- Exit time of a centered random walk from a cone
- On the exit time from a cone for random walks with drift
- Conditional limit theorems for ordered random walks
- The oscillating random walk
- Title not available (Why is that?)
- Nonlinear randomized urn models: a stochastic approximation viewpoint
- On the exit time from an orthant for badly oriented random walks
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)