We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed PEP serves as a tight bound for codes ...

In this letter, a generalization of pairwise models to non-Markovian epidemics on networks is presented. For the case of infectious periods of fixed length, the resulting pairwise model is a system of delay differential equations (DDE), which shows excellent agreement with results based on explicit stochastic simulations of non-Markovian epidemics on networks. Furthermore, we analytically compu...

We present a deterministic linear time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-...

We consider the problem of estimating latent positions in a one-dimensional torus from pairwise affinities. The observed affinity between pair items is modeled as noisy observation function f(xi∗,xj∗) xi∗,xj∗ two on torus. f unknown, and it only assumed to fulfill some shape constraints ensuring that f(x,y) large when distance x y small, vice-versa. This non-parametric modeling offers good flex...

In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group G, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided. Basic criteria for finding a nearest consistent pairwise comparisons matrix (extended to the class of group G) are proposed. A geometric interpretation of pairwis...