Related papers: Union of Random Minkowski Sums and Network Vulnera…

In the Minimum k-Union problem (MkU) we are given a set system with n sets and are asked to select k sets in order to minimize the size of their union. Despite being a very natural problem, it has received surprisingly little attention: the…

In this paper, we propose a novel statistic of networks, the normalized clustering coefficient, which is a modified version of the clustering coefficient that is robust to network size, network density and degree heterogeneity under…

For $0 < \lambda < 1$ and $n \rightarrow \infty$ pick uniformly at random $\lambda n$ vectors in $\{0,1\}^n$ and let $C$ be the orthogonal complement of their span. Given $0 < \gamma < \frac12$ with $0 < \lambda < h(\gamma)$, let $X$ be the…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

The Minkowski functionals are useful statistics to quantify the morphology of various random fields. They have been applied to numerous analyses of geometrical patterns, including various types of cosmic fields, morphological image…

We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…

To each edge (i,j), i<j of the complete directed graph on the integers we assign unit weight with probability p or weight x with probability 1-p, independently from edge to edge, and give to each path weight equal to the sum of its edge…

Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…

Mixture models have received considerable attention recently and Newton [Sankhy\={a} Ser. A 64 (2002) 306--322] proposed a fast recursive algorithm for estimating a mixing distribution. We prove almost sure consistency of this recursive…

We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…

In this paper, we study the hypothesis testing problem of, among $n$ random variables, determining $k$ random variables which have different probability distributions from the rest $(n-k)$ random variables. Instead of using separate…

In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…

This paper considers the radii functionals (circumradius, inradius, and diameter) as well as the Minkowski asymmetry for general (possibly non-symmetric) gauge bodies. A generalization of the concentricity inequality (which states that the…

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as…

The effect that weighted summands have on each other in approximations of $S=w_1S_1+w_2S_2+\cdots+w_NS_N$ is investigated. Here, $S_i$'s are sums of integer-valued random variables, and $w_i$ denote weights, $i=1,\dots,N$. Two cases are…

Non-uniform estimates are obtained for Poisson, compound Poisson, translated Poisson, negative binomial and binomial approximations to sums of of m-dependent integer-valued random variables. Estimates for Wasserstein metric also follow…

We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…

Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage $n$ is a non-negative integer. For any given vertex $x$ of SG(n), we derive rigorously the probability distribution of the degree $j \in \{1,2,3,4\}$ at the…