Results 251 to 260 of about 304,307 (287)
Testing Strict Monotonicity in Nonparametric Regression [PDF]
Mathematical Methods of Statistics, 2007 A new test for strict monotonicity of the regression function is proposed which is based on a composition of an estimate of the inverse of the regression function with a common regression estimate. This composition is equal to the identity if and only if the “true” regression function is strictly monotone, and a test based on an L2-distance is ...
Holger Dette
exaly +7 more sources
Existence of Minimizers for Non-Quasiconvex Functionals by Strict Monotonicity
Communications on Pure and Applied Analysis, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandro Zagatti
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Iterative Monotonicity is equivalent to strict group monotonicity**: A direct proof
SSRN Electronic Journal, 2021We provide a direct proof of the following result: Iterative Monotonicity is equivalent to strict group monotonicity**, provided that there are three or more players.
Ritesh Jain +2 more
openaire +1 more source
Monotone Path-Connectedness of Strict Suns
Lobachevskii Journal of Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Monotonicity and Best Approximation in Orlicz–Sobolev Spaces With the Luxemburg Norm
Journal of Mathematical Analysis and Applications, 2008 Criteria for strict monotonicity, upper (lower) locally uniform monotonicity and uniform monotonicity of Orlicz–Sobolev spaces with the Luxemburg norm are given.
Henryk Hudzik +2 more
exaly +2 more sources
Strict Monotonicity of Percolation Thresholds Under Covering Maps [PDF]
Annals of Probability, 2019 We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph strictly increases the value of its percolation critical parameter $p_c$. More precisely, let $\mathcal{G}=(V,E)$ be a quasi-transitive graph with $p_c(\mathcal{G})<1$, and let $G$ be a nontrivial group that acts freely on $V$ by graph ...
Franco Severo, Sébastien Martineau
exaly +5 more sources
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lauri Hella +2 more
openaire +4 more sources
Econometrica, 1998
MILGROM AND SHANNON (1994) clarify the relationship between order-theoretic methods for comparative statics and more traditional differential techniques by developing relationships between the differential Spence-Mirrlees single crossing property and the order-theoretic single crossing property.
Edlin, Edi, Shannon, Chris
openaire +2 more sources
MILGROM AND SHANNON (1994) clarify the relationship between order-theoretic methods for comparative statics and more traditional differential techniques by developing relationships between the differential Spence-Mirrlees single crossing property and the order-theoretic single crossing property.
Edlin, Edi, Shannon, Chris
openaire +2 more sources
Head-strictness is not a monotonic abstract property
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Strict Monotonicity and Convergence Rate of Titterington’s Algorithm for Computing D-Optimal Designs [PDF]
Computational Statistics and Data Analysis, 2010 We study a class of multiplicative algorithms introduced by Silvey et al. (1978) for computing D-optimal designs. Strict monotonicity is established for a variant considered by Titterington (1978). A formula for the rate of convergence is also derived. This is used to explain why modifications considered by Titterington (1978) and Dette et al.
Yaming Yu
exaly +3 more sources