English
Related papers

Related papers: Orderings on measures induced by higher-order mono…

200 papers

The consultative papers for the Basel II Accord require rating systems to provide a ranking of obligors in the sense that the rating categories indicate the creditworthiness in terms of default probabilities. As a consequence, the default…

Condensed Matter · Physics 2011-08-09 Dirk Tasche

Let $X$ be a rearrangement-invariant space over a non-atomic $\sigma$-finite measure space $(\mathscr{R},\mu)$ and let $\alpha\in(0,\infty)$. We define the functional \begin{equation*} \|f\|_{X^{\langle \alpha \rangle}} =…

Functional Analysis · Mathematics 2021-09-13 Hana Turčinová

We consider a randomly forced Ginzburg-Landau equation on an unbounded domain. The forcing is smooth and homogeneous in space and white noise in time. We prove existence and smoothness of solutions, existence of an invariant measure for the…

Analysis of PDEs · Mathematics 2007-05-23 Jacques Rougemont

In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate functions $f$ that satisfy $f(0)=0$, $f$ is increasing and concave on $[0,+\infty)$, $f$ is twice differentiable on…

Optimization and Control · Mathematics 2018-10-12 Luze Xu , Jon Lee , Daphne Skipper

We study optimization problems in which a linear functional is maximized over probability measures that are dominated by a given measure according to an integral stochastic order in an arbitrary dimension. We show that the following four…

Theoretical Economics · Economics 2026-03-13 Frank Yang , Kai Hao Yang

This paper explores the connection between classical isoperimetric inequalities, their directed analogues, and monotonicity testing. We study the setting of real-valued functions $f : [0,1]^d \to \mathbb{R}$ on the solid unit cube, where…

Data Structures and Algorithms · Computer Science 2024-10-03 Renato Ferreira Pinto

We introduce a new dependence order, termed the conditional convex order, whose minimal and maximal elements characterize independence and perfect dependence. Moreover, it characterizes conditional independence, satisfies information…

Statistics Theory · Mathematics 2026-01-22 Jonathan Ansari , Sebastian Fuchs

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

Logic in Computer Science · Computer Science 2024-05-21 Isa Vialard

The modified Lommel function $t_{\mu,\nu}(x)$ is an important special function, but to date there has been little progress on the problem of obtaining functional inequalities for $t_{\mu,\nu}(x)$. In this paper, we advance the literature…

Classical Analysis and ODEs · Mathematics 2020-01-30 Robert E. Gaunt

The paper is devoted to obtain first and second order necessary optimality conditions for continuous-time optimization problems with equality and inequality constraints. A full rank type regularity condition along with an uniform implicit…

Optimization and Control · Mathematics 2023-05-10 Moisés Rodrigues Cirilo do Monte , Valeriano Antunes de Oliveira

For non-decreasing real functions $f$ and $g$, we consider the functional $ T(f,g ; I,J)=\int_{I} f(x)\di g(x) + \int_J g(x)\di f(x)$, where $I$ and $J$ are intervals with $J\subseteq I$. In particular case with $I=[a,t]$, $J=[a,s]$, $s\leq…

Classical Analysis and ODEs · Mathematics 2011-10-31 Milan Merkle , Dan Marinescu , Monica Moulin Ribeiro Merkle , Mihai Monea , Marian Stroe

Given an equilibrium state $\mu$ for a continuous function $f$ on a shift of finite type $X$, the pressure of $f$ is the integral, with respect to $\mu$, of the sum of $f$ and the information function of $\mu$. We show that under certain…

Dynamical Systems · Mathematics 2014-01-14 Brian Marcus , Ronnie Pavlov

A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in…

Computational Complexity · Computer Science 2018-06-05 Elena Grigorescu , Akash Kumar , Karl Wimmer

For non-uniformly expanding maps inducing with a general return time to Gibbs Markov maps, we provide sufficient conditions for obtaining higher order asymptotics for the correlation function in the infinite measure setting. Along the way,…

Dynamical Systems · Mathematics 2015-10-16 Henk Bruin , Dalia Terhesiu

We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…

Operator Algebras · Mathematics 2007-05-23 Frank Hansen , Jun Tomiyama

We study coarea inequalities for metric surfaces -- metric spaces that are topological surfaces, without boundary, and which have locally finite Hausdorff 2-measure $\mathcal{H}^2$. For monotone Sobolev functions $u\colon X \to \mathbb{R}…

Metric Geometry · Mathematics 2022-08-15 Behnam Esmayli , Toni Ikonen , Kai Rajala

We prove a weak-type (1, 1) inequality involving conditioned versions of square functions for martingales in noncommutative $L^p$-spaces associated with finite von Neumann algebras. As application, we determine the optimal orders for the…

Operator Algebras · Mathematics 2011-11-09 Narcisse Randrianantoanina

Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper bound lub$(Y)\in X$, a chain being a subset of $X$ totally ordered by $\le$. We…

Logic · Mathematics 2015-02-24 Frédéric Blanqui

A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…

Discrete Mathematics · Computer Science 2014-01-14 Deeparnab Chakrabarty , C. Seshadhri

The study of first-order optimization algorithms (FOA) typically starts with assumptions on the objective functions, most commonly smoothness and strong convexity. These metrics are used to tune the hyperparameters of FOA. We introduce a…

Machine Learning · Computer Science 2024-05-30 Charles Guille-Escuret , Baptiste Goujaud , Manuela Girotti , Ioannis Mitliagkas
‹ Prev 1 4 5 6 7 8 10 Next ›