相关论文: Combinatorics of geometrically distributed random …

Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…

We consider the asymptotic behavior of the expectation of the maximum for a special assignment process with constant or i.i.d. coefficients. We show how it depends on the coefficients' distribution.

Let $\xi$ be an integrable random variable defined on $(\Omega, \mathcal{F}, \mathbb{P})$. Fix $k\in \mathbb{Z}_+$ and let $\{\mathcal{G}_{i}^{j}\}_{1\le i \le n, 1\le j \le k}$ be a reference family of sub-$\sigma$-fields of $\mathcal{F}$,…

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…

Randomly sampling an acyclic orientation on the complete bipartite graph $K_{n,k}$ with parts of size $n$ and $k$, we investigate the length of the longest path. We provide a probability generating function for the distribution of the…

We present the results of computer experiments suggesting that the probability that a random multiword in a free group is virtually geometric decays to zero exponentially quickly in the length of the multiword. We then prove this fact.

Additive composition (Foltz et al, 1998; Landauer and Dumais, 1997; Mitchell and Lapata, 2010) is a widely used method for computing meanings of phrases, which takes the average of vector representations of the constituent words. In this…

Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…

We study large partial sums, localized with respect to the sums of variances, of a sequence of centered random variables. An application is given to the distribution of prime factors of typical integers.

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

In this paper, we will consider the properties of amalgamated R-diagonal pairs. We characterize the amalgamated R-diagonality of pairs of amalgamated random variables by certain cumulant-relation.

As the extension of uncorrelated single-valued random variables, set-valued case is studied in this paper. When the underlying space is of finite dimension, by using the support function, We shall prove the weak and strong laws of large…

Extended geometric distribution is defined and its mixture is characterized by the property of having completely monotone probability sequence. Also, convolution equations and probability generating functions are used to characterize…

Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the components of f-vectors of random polytopes…

We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.

We review recent progress in understanding the meaning of mutual information in natural language. Let us define words in a text as strings that occur sufficiently often. In a few previous papers, we have shown that a power-law distribution…

We establish a precise three-term asymptotic expansion, with an optimal estimate of the error term, for the rightmost eigenvalue of an $n\times n$ random matrix with independent identically distributed complex entries as $n$ tends to…

It is shown that max-stable random vectors in $[0,\infty)^d$ with unit Fr\'echet marginals are in one to one correspondence with convex sets $K$ in $[0,\infty)^d$ called max-zonoids. The max-zonoids can be characterised as sets obtained as…

Convolutions of independent random variables often arise in a natural way in many applied problems. In this article, we compare convolutions of two sets of gamma (negative binomial) random variables in the convolution order and the usual…