scientific article; zbMATH DE number 7565956

Publication date: 2 August 2022

Full work available at URL: https://alea.impa.br/articles/v19/19-40.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Functional limit theorems; invariance principles (60F17)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Tagged particle dynamics in stochastic ranking process
Stochastic ranking process with time dependent intensities
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Least-recently-used caching with dependent requests
The limiting move-to-front search-cost in law of large numbers asymptotic regimes
Existence of an infinite particle limit of stochastic ranking process
Self-organizing sequential search and Hilbert's inequalities
Asymptotic miss ratios over independent references
Generalized Ornstein-Uhlenbeck processes and infinite particle branching Brownian motions
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
Cancellation of fluctuation in stochastic ranking process with space-time dependent intensities
Stochastic ranking process with space-time dependent intensities
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
FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
The stationary distribution of an interesting Markov chain

This page was built for publication: