Related papers: Dvoretzky covering problem for general measures
We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
The robustness of the universality class concept of the chaotic transition was investigated by analytically obtaining its critical exponent for a wide class of maps. In particular, we extended the existing one-dimensional chaotic maps,…
The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous…
Given a relatively compact set $\Omega \subseteq \mathbb{R}$ of Lebesgue measure $|\Omega|$ and $\varepsilon > 0$, we show the existence of a set $\Lambda \subseteq \mathbb{R}$ of uniform density $D (\Lambda) \leq (1+\varepsilon) |\Omega|$…
In the stochastic set cover problem (Grandoni et al., FOCS '08), we are given a collection $\mathcal{S}$ of $m$ sets over a universe $\mathcal{U}$ of size $N$, and a distribution $D$ over elements of $\mathcal{U}$. The algorithm draws $n$…
Dispersion is a fundamental concept in statistics, yet standard approaches - especially via stochastic orders - face limitations in the discrete setting. In particular, the classical dispersive order, well-established for continuous…
We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our…
In this article we initiate a systematic study of the well-posedness theory of the Einstein constraint equations on compact manifolds with boundary. This is an important problem in general relativity, and it is particularly important in…
We investigate the parameterized complexity of GENERALIZED RED BLUE SET COVER (Gen-RBSC), a generalization of the classic SET COVER problem and the more recently studied RED BLUE SET COVER problem. Given a universe $U$ containing $b$ blue…
This paper focuses on the study of existence and uniqueness of distributional and classical solutions to the Cauchy Boltzmann problem for the soft potential case assuming $S^{n-1}$ integrability of the angular part of the collision kernel…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given…
There is a well understood way of generating random coverings of a fixed manifold by sampling homomorphisms from the fundamental group of this manifold into the symmetric group. We prove a central limit theorem for the number of connected…
The general dual volume $\dveV(K)$ and the general dual Orlicz curvature measure $\deV(K, \cdot)$ were recently introduced for functions $G: (0, \infty)\times \sphere\rightarrow (0, \infty)$ and convex bodies $K$ in $\R^n$ containing the…
Zurek's derivation of Born's rule using envariance (invariance due to entanglement) is considered to capture the probability in full generality, but only as applied to measurement of a quantum observable. Contrariwise, textbook formulations…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
We investigate a linear diffusion equation incorporating historical effects, characterised by a finite non-negative Borel measure on \((0, \mathfrak T]\). This approach accommodates both distributed memory and discrete delays within a…