Stochastic ranking process with time dependent intensities
DOI10.2748/tmj/1303219937zbMath1218.60087arXiv1010.5045OpenAlexW2105654278MaRDI QIDQ542907
Kumiko Hattori, Tetsuya Hattori, Yuusuke Takeshima, Yuu Hariya, Takahisa Kobayashi, Yukio Nagahata
Publication date: 20 June 2011
Published in: Tôhoku Mathematical Journal. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5045
hydrodynamic limitPoisson random measurestochastic ranking processinviscid Burgers equation with evaporationleast-recently-used cachingmove-to-front rules
Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Solutions to PDEs in closed form (35C05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule
- Least-recently-used caching with dependent requests
- Existence of an infinite particle limit of stochastic ranking process
- Self-organizing sequential search and Hilbert's inequalities
- Asymptotic miss ratios over independent references
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
- An exact formula for the move-to-front rule for self-organizing lists
- The persistent-access-caching algorithm
- Equation of Motion for Incompressible Mixed Fluid Driven by Evaporation and Its Application to Online Rankings
- Transience and recurrence of an interesting Markov chain
- On self-organizing sequential search heuristics
- Heuristics That Dynamically Organize Data Structures
- On a model for storage and search
- Convergence to stationary state for a Markov move-to-front scheme
- On Serial Files with Relocatable Records
- FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
- The stationary distribution of an interesting Markov chain
This page was built for publication: Stochastic ranking process with time dependent intensities