Related papers: Monotone rearrangement in averaging classes
This paper introduces the class of selfdecomposable distributions concerning Boolean convolution. A general regularity property of Boolean selfdecomposable distributions is established; in particular the number of atoms is at most two and…
We derive bounds on the mean oscillation of the decreasing rearrangement $f^*$ on $\mathbb{R}_+$ in terms of the mean oscillation of $f$ on a suitable measure space $X$. In the special case of a doubling metric measure space, the bound…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…
There are well-known examples of dynamical systems for which the Birkhoff averages with respect to a given observable along some or all of the orbits do not converge. It has been suggested that such orbits could be classified using higher…
We introduce and analyze a new class of monotone stochastic recursions in a regenerative environment which is essentially broader than that of Markov chains. We prove stability theorems and apply our results {to three canonical models in…
Regression analysis under the assumption of monotonicity is a well-studied statistical problem and has been used in a wide range of applications. However, there remains a lack of a broadly applicable methodology that permits information…
The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar…
We use the method of monotone iterations to obtain fixed point and coupled fixed point results for mixed monotone operators in the setting of partially ordered sets, with no additional assumptions on the partial order and with no…
Consider the configuration spaces of manifolds. An influential theorem of McDuff, Segal and Church shows that the (co)homology of the unordered configuration space is independent of number of points in a range of degree called the stable…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
We illustrate how to extend the concept of structural stability through applying it to the front propagation speed selection problem. This consideration leads us to a renormalization group study of the problem. The study illustrates two…
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…
We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…
Non-minimal renormalisation schemes such as the momentum subtraction scheme (MOM) have frequently been used for physical computations. The consistency of such a scheme relies on the existence of a coupling redefinition linking it to MSbar.…
Human recursive numeral systems (i.e., counting systems such as English base-10 numerals), like many other grammatical systems, are highly regular. Following prior work that relates cross-linguistic tendencies to biases in learning, we ask…
We present consistent algorithms for multiclass learning with complex performance metrics and constraints, where the objective and constraints are defined by arbitrary functions of the confusion matrix. This setting includes many common…
We develop a monotone, two-scale discretization for a class of integrodifferential operators of order $2s$, $s \in (0,1)$. We apply it to develop numerical schemes, and derive pointwise convergence rates, for linear and obstacle problems…
We consider a very general definition of BMO on a domain in $\mathbb{R}^n$, where the mean oscillation is taken with respect to a basis of shapes, i.e. a collection of open sets covering the domain. We examine the basic properties and…
Currently, knowledge discovery in databases is an essential step to identify valid, novel and useful patterns for decision making. There are many real-world scenarios, such as bankruptcy prediction, option pricing or medical diagnosis,…