相关论文: Union of Random Minkowski Sums and Network Vulnera…

General extensions of an inequality due to Rogozin, concerning the essential supremum of a convolution of probability density functions on the real line, are obtained. While a weak version of the inequality is proved in the very general…

More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum…

Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is…

We investigate the validity and the stability of various Minkowski-like inequalities for $C^1$-perturbations of the ball. Let $K\subseteq\mathbb R^n$ be a domain (possibly not convex and not mean-convex) which is $C^1$-close to a ball. We…

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of exponent vectors described by a set $A_i \subseteq \mathbb{Z}^n$ of cardinality $t_i$, whose convex hull…

In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…

We investigate the \emph{minimum weight cycle (MWC)} problem in the $\mathsf{CONGEST}$ model of distributed computing. For undirected weighted graphs, we design a randomized algorithm that achieves a $(k+1)$-approximation, for any…

Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…

Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Let $P_n(x) = \sum_{k=0}^{n} \xi_k x^k$ be a Kac random polynomial, where the coefficients $\xi_k$ are i.i.d.\ copies of a given random variable $\xi$. Based on numerical experiments, it has been conjectured that if $\xi$ has mean zero,…

For most networks, the connection between two nodes is the result of their mutual affinity and attachment. In this paper, we propose a mutual selection model to characterize the weighted networks. By introducing a general mechanism of…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…

We propose to derive deviation measures through the Minkowski gauge of a given set of acceptable positions. We show that, given a suitable acceptance set, any positive homogeneous deviation measure can be accommodated in our framework. In…