Sharp bounds for exponential approximations under a hazard rate upper bound
نویسندگان
چکیده
منابع مشابه
Exponential Models: Approximations for Probabilities
Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...
متن کاملSharp Upper Bounds for Multiplicative Zagreb Indices
For a (molecular) graph, the multiplicative Zagreb indices ∏ 1-index and ∏ 2index are multiplicative versions of the ordinary Zagreb indices (M1-index and M2index). In this note we report several sharp upper bounds for ∏ 1-index in terms of graph parameters including the order, size, radius, Wiener index and eccentric distance sum, and upper bounds for ∏ 2-index in terms of graph parameters inc...
متن کاملUpper Bounds for Spatial Point Process Approximations
We consider the behavior of spatial point processes when subjected to a class of linear transformations indexed by a variable T. It was shown in Ellis [Adv. in Appl. Probab. 18 (1986) 646–659] that, under mild assumptions, the transformed processes behave approximately like Poisson processes for large T. In this article, under very similar assumptions, explicit upper bounds are given for the d2...
متن کاملSharp upper bounds for a variational problem with singular perturbation
Let Ω be a C bounded open set of R and consider the functionals Fε(u) := ∫ Ω { (1 − |∇u(x)|2)2 ε + ε|Du(x)| } dx . We prove that if u ∈ W (Ω), |∇u| = 1 a.e., and ∇u ∈ BV , then Γ− lim ε↓0 Fε(u) = 1 3 ∫ J∇u |[∇u]|dH 1 . The new result is the Γ− lim sup inequality.
متن کاملA Sharp Upper Bound for the Lattice Programming Gap
Given a full-dimensional lattice Λ ⊂ Z and a vector l ∈ Qd>0, we consider the family of the lattice problems Minimize {l · x : x ≡ r(mod Λ),x ∈ Zd≥0} , r ∈ Z d . (0.1) The lattice programming gap gap(Λ, l) is the largest value of the minima in (0.1) as r varies over Z. We obtain a sharp upper bound for gap(Λ, l).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2015
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200113476