相关论文: Extremal elements of a sublattice of the majorizat…

This paper proposes a novel technique for the approximation of strong solutions $u \in C(\overline{\Omega}) \cap W^{2,n}_\mathrm{loc}(\Omega)$ to uniformly elliptic linear PDE of second order in nondivergence form with continuous leading…

Maximum entropy (MAXENT) method has a large number of applications in theoretical and applied machine learning, since it provides a convenient non-parametric tool for estimating unknown probabilities. The method is a major contribution of…

G. Edelman, O. Sporns, and G. Tononi introduced in theoretical biology the neural complexity of a family of random variables. This functional is a special case of intricacy, i.e., an average of the mutual information of subsystems whose…

We develop a maximum relative entropy formalism to generate optimal approximations to probability distributions. The central results consist in (a) justifying the use of relative entropy as the uniquely natural criterion to select a…

This article investigates sharp comparison of moments for various classes of random variables appearing in a geometric context. In the first part of our work we find the optimal constants in the Khintchine inequality for random vectors…

It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…

In this note, we investigate the extreme points of the unit ball of the James Tree space ($JT$). We relate the geometric structure of $JT$ to the classical James space $J$ and provide partial characterizations of extremality based on the…

Let $G$ be a graph of minimum degree at least $k$ and let $G_p$ be the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. We are interested in the size of the largest complete minor that $G_p$ contains…

We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…

The core arguments used in various proofs of the extremal principle and its extensions as well as in primal and dual characterizations of approximate stationarity and transversality of collections of sets are exposed, analyzed and refined,…

We derive by lattice theory a universal quantum certainty relation for arbitrary $M$ observables in $N$-dimensional system, which provides a state-independent maximum lower bound on the direct-sum of the probability vectors in terms of…

We describe the set of parameters $(p_1,p_2,q_1,q_2)$ such that the balls $B_{q_1,q_2}^{s,b}$ are rigid in $\ell_{q_1,q_2}^{s,b}$ metric i.e. they are poorly approximated by linear subspaces of dimension $\le (1-\varepsilon)sb$, for large…

Previously, Erd\H{o}s, Kierstead and Trotter investigated the dimension of random height~$2$ partially ordered sets. Their research was motivated primarily by two goals: (1)~analyzing the relative tightness of the F\"{u}redi-Kahn upper…

Consider a variant of the Mastermind game in which queries are $\ell_p$ distances, rather than the usual Hamming distance. That is, a codemaker chooses a hidden vector $\mathbf{y}\in\{-k,-k+1,\dots,k-1,k\}^n$ and answers to queries of the…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have…

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

We prove that the extremal process of branching Brownian motion, in the limit of large times, converges weakly to a cluster point process. The limiting process is a (randomly shifted) Poisson cluster process, where the positions of the…

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

In this paper we develop an extremal eigenvalue approach to the problem of construction of free boundary minimal surfaces in the product of Euclidean balls of chosen radii. The extremal problem involves a linear combination of normalized…