Related papers: Random bipartite posets and extremal problems
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
Felsner and Reuter introduced the linear extension diameter of a partially ordered set $\mathbf{P}$, denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear extensions of $\mathbf{P}$, where distance is defined to be…
Partially ordered sets (posets) are fundamental combinatorial objects with important applications in computer science. Perhaps the most natural algorithmic task, given a size-$n$ poset, is to compute its number of linear extensions. In 1991…
We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes…
The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a variation called local dimension which makes use of partial…
Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius $r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
The aim of this paper is to investigate extremum problems with pay-off being the total variational distance metric defined on the space of probability measures, subject to linear functional constraints on the space of probability measures,…
Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, including…
We consider Hotelling's T^2 statistic for an arbitrary d-dimensional sample. If the sampling is not too deterministic or inhomogeneous, then under zero means hypothesis, T^2 tends to \chi^2_d in distribution. We show that a test for the…
We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii $(k^{-\alpha})_{k=1}^\infty$ and centres chosen independently at random according to an…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
We establish a conjecture of Defant, Hopkins, Poznanovi\'{c}, and Propp concerning the dimensions of toggleability spaces for products of chains, shifted staircases, type-A root posets, and type-B posets. Generalizing this result, we show…
The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…
Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…
We get back to the computation of the leading finite size corrections to some random link matching problems, first adressed by Mezard and Parisi [J. Physique 48 (1987) 1451-1459]. In the so-called bipartite case, their result is in…