Related papers: When is the rate function of a random vector stric…

This paper presents a necessary and sufficient condition for a real-valued function defined on an open and convex subset of a Banach space to be quasi-concave, and a sufficient condition for such a function to be strictly quasi-concave.…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

Regular variation of a multivariate measure with a Lebesgue density implies the regular variation of its density provided the density satisfies some regularity conditions. Unlike the univariate case, the converse also requires regularity…

We show the existence of variable-rate rate-distortion codes that meet the disortion constraint almost surely and are minimax, i.e., strongly, universal with respect to an unknown source distribution and a distortion measure that is…

We show that positively $1$--homogeneous rank one convex functions are convex at $0$ and at matrices of rank one. The result is a special case of an abstract convexity result that we establish for positively $1$--homogeneous directionally…

We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…

We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…

We stduy $L^p-L^r$ restriction estimates for algebraic varieties $V$ in the case when restriction operators act on radial functions in the finite field setting. We show that if the varieties $V$ lie in odd dimensional vector spaces over…

The probabilistic interpretation of Laplace transforms is used to help to describe the Laplace Transform $L(s)$ of improper random variables. In particular, busy periods in queueing models are examined. The value of $L(0)$ is explained in…

The Gaver-Stehfest algorithm is widely used for numerical inversion of Laplace transform. In this paper we provide the first rigorous study of the rate of convergence of the Gaver-Stehfest algorithm. We prove that Gaver-Stehfest…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

Many models for complex phenomena use a model for strongly-interacting elements on a small scale to generate larger-scale simulations of some aspects of experimental realizations. These models may be agent-based (as in the case of discrete…

In this paper, we introduce a new notion of convergence for the Laplace eigenfunctions in the semiclassical limit, the local weak convergence. This allows us to give a rigorous statement of Berry's random wave conjecture. Using recent…

We consider the problem of reconstructing a function given its values on a set of points with finite density. We prove that with probability one, the values of an almost periodic function on a random array of points (with finite density)…

We define a new class of positive and Lebesgue measurable functions in terms of their asymptotic behavior, which includes the class of regularly varying functions. We also characterize it by transformations, corresponding to generalized…

Let $f$ be a measurable, real function defined in a neighbourhood of infinity. The function $f$ is said to be of generalised regular variation if there exist functions $h \not\equiv 0$ and $g > 0$ such that $f(xt) - f(t) = h(x) g(t) +…

Let $X$ be an arbitrary real-valued random variable (r.v.), with the characteristic function (c.f.) $f$. Integral expressions for the c.f.\ of the r.v.'s $\max(0,X)$ in terms of $f$ are given, as well as other related results. Applications…

We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…

We extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust…

Motivated by tug-of-war games and asymptotic analysis of certain variational problems, we consider a gradient constraint problem involving the infinity Laplace operator. We prove that this problem always has a solution that is unique if a…