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

In this paper we consider the clustering coefficient and clustering function in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are…

Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull…

Motivated by applications in statistics and machine learning, we consider a problem of unmixing convex combinations of nonparametric densities. Suppose we observe $n$ groups of samples, where the $i$th group consists of $N_i$ independent…

Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…

The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with…

We propose a self-improving algorithm for computing Voronoi diagrams under a given convex distance function with constant description complexity. The $n$ input points are drawn from a hidden mixture of product distributions; we are only…

Let $G_1,\dots, G_m$ be independent Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having variable sizes $X_1,\dots, X_m\in \{0,1,2,\dots\}$ and densities $Q_1,\dots, Q_m\in [0,1]$. Letting $n,m\to+\infty$ we establish the…

Let $\mathbb{K}$ be a field of characteristic $0$. For each choice of distinct $a_1, \ldots, a_n\in \mathbb{K}$ and distinct $b_1, \ldots, b_n\in \mathbb{K}$, consider the sum $S=\sum_{i=1}^n a_i b_{\pi(i)}$ as $\pi$ ranges over the…

In this paper, we consider the maximization of a probability $\mathbb{P}\{ \zeta \mid \zeta \in \mathbf{K}(\mathbf x)\}$ over a closed and convex set $\mathcal X$, a special case of the chance-constrained optimization problem. We define…

Over the years, quantifying the similarity of nodes has been a hot topic in complex networks, yet little has been known about the distributions of node-similarity. In this paper, we consider a typical measure of node-similarity called the…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

Let $\{\varphi_k\}_{k=0}^\infty $ be a sequence of orthonormal polynomials on the unit circle (OPUC) with respect to a probability measure $ \mu $. We study the variance of the number of zeros of random linear combinations of the form $$…

We study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. Our main result asserts that for every pair…

The random coefficients model $Y_i={\beta_0}_i+{\beta_1}_i {X_1}_i+{\beta_2}_i {X_2}_i+\ldots+{\beta_d}_i {X_d}_i$, with $\mathbf{X}_i$, $Y_i$, $\mathbf{\beta}_i$ i.i.d, and $\mathbf{\beta}_i$ independent of $X_i$ is often used to capture…

Minkowski functionals quantify the morphology of smooth random fields. They are widely used to probe statistical properties of cosmological fields. Analytic formulae for ensemble expectations of Minkowski functionals are well known for…

Let $C$ be the classical middle third Cantor set. It is well known that $C+C = [0,2]$ (Steinhaus, 1917). (Here $+$ denotes the Minkowski sum.) Let $U$ be the set of $z \in [0,2]$ which have a unique representation as $z = x + y$ with $x, y…

For a collection of convex bodies $P_1,\dots,P_n \subset \mathbb{R}^d$ containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as…

The manifold hypothesis suggests that the generalization performance of machine learning methods improves significantly when the intrinsic dimension of the input distribution's support is low. In the context of KRR, we investigate two…

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…