Nonparametric estimation in renewal theory. II: Solutions of renewal-type equations
نویسندگان
چکیده
منابع مشابه
Nonparametric estimation and consistency for renewal processes
In reliability or medical studies, we may only observe each ongoing renewal process for a certain period of time. When the underlying distribution F is arithmetic, Vardi (Ann. Statist. 10 (1982b), 772-785) developed the RT algorithm for nonparametric estimation. In this paper we extend the study to the nonarithmetic case and show that the choice of an arbitrary constant in the RT algorithm can ...
متن کاملIEOR 6711 : Introduction to Renewal Theory II
Here we will present some deeper results in renewal theory such as a central limit theorem for counting processes, stationary versions of renewal processes, renewal equations, the key renewal theorem, weak convergence. 1 Central limit theorem for counting processes Consider a renewal process {t n : n ≥ 1} with iid interarrival times X n = t n − t n−1 , n ≥ 0, such that 0 < E(X) = 1/λ < ∞ and 0 ...
متن کاملNonparametric Renewal Function Estimation and Smoothing by Empirical Data
We consider an estimate of the renewal function (rf) using a limited number of independent observations of the interarrival times for an unknown interarrival-time distribution (itd). The nonparametric estimate is derived from the rf-representation as series of distribution functions (dfs) of consecutive arrival times using a finite summation and approximations of the latter by empirical dfs. Du...
متن کاملRenewal Theory
(1) Sn = S0 + n ∑ i=1 Xi When S0 = 0 the renewal process is an ordinary renewal process; when S0 is a nonnegative random variable the renewal process is a delayed renewal process. In either case, the individual terms Sn of this sequence are called renewals, or sometimes occurrences. With each renewal process is associated a renewal counting process N (t ) that tracks the total number of renewal...
متن کاملRenewal Monte Carlo: Renewal theory based reinforcement learning
In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with a designated start state. RMC is a Monte Carlo algorithm and retains the advantages of Monte Carlo methods including low bias, simplicity, and ease of implementation while, at the same time, circumvents their key drawbacks of high variance a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2000
ISSN: 0090-5364
DOI: 10.1214/aos/1016120366