Related papers: Random bipartite posets and extremal problems
Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…
The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult…
Central limit theorems (CLTs) for high-dimensional random vectors with dimension possibly growing with the sample size have received a lot of attention in the recent times. Chernozhukov et al. (2017) proved a Berry--Esseen type result for…
This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a…
Gaussian random polytopes have received a lot of attention especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less studied case where the dimension goes to infinity and the…
We consider the following classical conjecture of Besicovitch: a $1$-dimensional Borel set in the plane with finite Hausdorff $1$-dimensional measure $\mathcal{H}^1$ which has lower density strictly larger than $\frac{1}{2}$ almost…
Multiple-choice load balancing has been a topic of intense study since the seminal paper of Azar, Broder, Karlin, and Upfal. Questions in this area can be phrased in terms of orientations of a graph, or more generally a k-uniform random…
Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…
In 2015, Felsner, Trotter, and Wiechert showed that posets with outerplanar cover graphs have bounded dimension. We generalise this result to posets with $k$-outerplanar cover graphs. Namely, we show that posets with $k$-outerplanar cover…
We study metric projections onto cones in the Wasserstein space of probability measures, defined by stochastic orders. Dualities for backward and forward projections are established under general conditions. Dual optimal solutions and their…
It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such…
We consider a class of convex optimization problems over the simplex of probability measures. Our framework comprises optimal experimental design (OED) problems, in which the measure over the design space indicates which experiments are…
This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…
Probability distributions and densities are derived for the excess and deficiency of the intensity or instantaneous energy (quasi-static power) associated with a $p$-dimensional random vector field. Explicit expressions for the exact…
Felsner, Li and Trotter showed that the dimension of the adjacency poset of an outerplanar graph is at most 5, and gave an example of an outerplanar graph whose adjacency poset has dimension 4. We improve their upper bound to 4, which is…
This paper is concerned with two extremal problems from matrix analysis. One is about approximating the top eigenspaces of a Hermitian matrix and the other one about approximating the orthonormal polar factor of a general matrix. Tight…
We use $p$-rank bounds on partial ovoids and the classical bounds on Ramsey numbers to obtain upper bounds on the size of partial $m$-ovoids in finite classical polar spaces. These bounds imply non-existence of $m$-ovoids for new infinite…
Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn <= t), where Sn is the sum of i.i.d. random variables X1, ..., Xn on the interval [0,1], satisfying…
We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…
Let $\bX=(X_1, \hdots, X_d)$ be a $\mathbb R^d$-valued random vector with i.i.d. components, and let $\Vert\bX\Vert_p= (\sum_{j=1}^d|X_j|^p)^{1/p}$ be its $p$-norm, for $p>0$. The impact of letting $d$ go to infinity on $\Vert\bX\Vert_p$…