Related papers: Simultaneous Joint Lower and Upper record values P…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
In this paper, we derive new probability bounds for Chebyshev's inequality if the supremum of the probability density function is known. This result holds for one-dimensional or multivariate continuous probability distributions with finite…
In the context of this paper, a record is an entry in a sequence of random variables (RV's) that is larger or smaller than all previous entries. After a brief review of the classic theory of records, which is largely restricted to sequences…
The probability density function (PDF) of a random variable associated with the solution of a partial differential equation (PDE) with random parameters is approximated using a truncated series expansion. The random PDE is solved using two…
Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…
Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each…
Query evaluation over probabilistic databases is known to be intractable in many cases, even in data complexity, i.e., when the query is fixed. Although some restrictions of the queries [19] and instances [4] have been proposed to lower the…
We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…
The joint likelihood is a simple extension of the standard likelihood formalism that enables the estimation of common parameters across disjoint datasets. Joining the likelihood, rather than the data itself, means nuisance parameters can be…
We prove a generalized version of Rogers' mean value formula in the space $X_n$ of unimodular lattices in $R^n$, which gives the mean value of a multiple sum over a lattice $L$ and its dual $L^*$. As an application, we prove that for $L$…
This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…
A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…
We derive new upper and lower bounds for probabilities that $r$ or at least $r$ from $n$ events occur. These bounds can turn to equalities. The method is discussed as well. It works for measurable space and measures with sign, too. We also…
Measuring the correlation (association) between two random variables is one of the important goals in statistical applications. In the literature, the covariance between two random variables is a widely used criterion in measuring the…
Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…
The problem of detecting changes in covariance for a single pair of features has been studied in some detail, but may be limited in importance or general applicability. In contrast, testing equality of covariance matrices of a {\it set} of…
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…
For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…
Affine su(3) and su(4) fusion multiplicities are characterised as discretised volumes of certain convex polytopes. The volumes are measured explicitly, resulting in multiple sum formulas. These are the first polytope-volume formulas for…