اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMeasuring the lack of monotonicity in functions
128
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Problems in econometrics, insurance, reliability engineering, and statistics quite often rely on the assumption that certain functions are non-decreasing. To satisfy this requirement, researchers frequently model the underlying phenomena using parametric and semi-parametric families of functions, thus effectively specifying the required shapes of the functions. To tackle these problems in a non-parametric way, in this paper we suggest indices for measuring the lack of monotonicity in functions. We investigate properties of the indices and also offer a convenient computational technique for practical use.
قيم البحث
اقرأ أيضاً
We provide an approach to maximal monotone bifunctions based on the theory of representative functions. Thus we extend to nonreflexive Banach spaces recent results due to A.N. Iusem and, respectively, N. Hadjisavvas and H. Khatibzadeh, where sufficie
nt conditions guaranteeing the maximal monotonicity of bifunctions were introduced. New results involving the sum of two monotone bifunctions are also presented.
Measuring association, or the lack of it, between variables plays an important role in a variety of research areas, including education, which is of our primary interest in this paper. Given, for example, student marks on several study subjects, we m
ay for a number of reasons be interested in measuring the lack of co-monotonicity (LOC) between the marks, which rarely follow monotone, let alone linear, patterns. For this purpose, in this paper we explore a novel approach based on a LOC index, which is related to, yet substantially different from, Eckhard Liebschers recently suggested coefficient of monotonically increasing dependence. To illustrate the new technique, we analyze a data-set of student marks on mathematics, reading and spelling.
The Patterson-Sullivan construction is proved almost surely to recover a Bergman function from its values on a random discrete subset sampled with the determinantal point process induced by the Bergman kernel on the unit ball $mathbb{D}_d$ in $mathbb
{C}^d$. For super-critical weighted Bergman spaces, the interpolation is uniform when the functions range over the unit ball of the weighted Bergman space. As main results, we obtain a necessary and sufficient condition for interpolation of a fixed pluriharmonic function in the complex hyperbolic space of arbitrary dimension (cf. Theorem 1.4 and Theorem 4.11); optimal simultaneous uniform interpolation for weighted Bergman spaces (cf. Theorem 1.8, Proposition 1.9 and Theorem 4.13); strong simultaneous uniform interpolation for weighted harmonic Hardy spaces (cf. Theorem 1.11 and Theorem 4.15); and establish the impossibility of the uniform simultaneous interpolation for the Bergman space $A^2(mathbb{D}_d)$ on $mathbb{D}_d$ (cf. Theorem 1.12 and Theorem 6.7).
We provide a set of counterexamples for the monotonicity of the Newton-Hewer method for solving the discrete-time algebraic Riccati equation in dynamic settings, drawing a contrast with the Riccati difference equation.
The ill-posedness of the inverse problem of recovering a regression function in a nonparametric instrumental variable model leads to estimators that may suffer from a very slow, logarithmic rate of convergence. In this paper, we show that restricting
the problem to models with monotone regression functions and monotone instruments significantly weakens the ill-posedness of the problem. In stark contrast to the existing literature, the presence of a monotone instrument implies boundedness of our measure of ill-posedness when restricted to the space of monotone functions. Based on this result we derive a novel non-asymptotic error bound for the constrained estimator that imposes monotonicity of the regression function. For a given sample size, the bound is independent of the degree of ill-posedness as long as the regression function is not too steep. As an implication, the bound allows us to show that the constrained estimator converges at a fast, polynomial rate, independently of the degree of ill-posedness, in a large, but slowly shrinking neighborhood of constant functions. Our simulation study demonstrates significant finite-sample performance gains from imposing monotonicity even when the regression function is rather far from being a constant. We apply the constrained estimator to the problem of estimating gasoline demand functions from U.S. data.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
