Related papers: Covering one point process with another

We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

Let $G_1,\dots, G_m$ be independent identically distributed Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having vertex sets of random sizes $X_1,\dots, X_m\in \{0,1,2,\dots\}$ and random edge densities $Q_1,\dots, Q_m\in…

Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset $Q'\subseteq Q$ with size at most k such that the sum of the weights of the…

We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…

In this article, we consider a sequence $(N_n)_{n \geq 1}$ of point processes, whose points lie in a subset $E$ of $\bR \verb2\2 \{0\}$, and satisfy an asymptotic independence condition. Our main result gives some necessary and sufficient…

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q_n such that every vector x in Q_n can be obtained from some vector c in C by changing at most R 1's of c to 0's, where R is as small as possible.…

We study the asymptotic behavior of the diameter or maximum interpoint distance of a cloud of i.i.d. $d$-dimensional random vectors when the number of points in the cloud tends to infinity. This is a non standard extreme value problem since…

Let $(M,g)$ be a smooth compact Riemannian surface with no boundary. Given a smooth vector field $V$ with finitely many zeroes on $M$, we study the distribution of the number of tangencies to $V$ of the nodal components of random…

This paper studies the asymptotic properties of weighted sums of the form $Z_n=\sum_{i=1}^n a_i X_i$, in which $X_1, X_2, \ldots, X_n$ are i.i.d.~random variables and $a_1, a_2, \ldots, a_n$ correspond to either eigenvalues or singular…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We are interested in the asymptotic behavior of $X_n(k)$ for intermediate levels $k=k_n$ satisfying $k_n\to\infty$ and $k_n=o(\log n)$ as…

Due to the applications in network coding, subspace codes and designs have received many attentions. Suppose that $k\mid n$ and $V(n,q)$ is an $n$-dimensional space over the finite field $\mathbb{F}_{q}$. A $k$-spread is a…

For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and…

A sorting network is a shortest path from $12\dots n$ to $n\dots 21$ in the Cayley graph of the symmetric group $\mathfrak S_n$ spanned by adjacent transpositions. The paper computes the edge local limit of the uniformly random sorting…

The problem of classifying boundary points of space-time, for example singularities, regular points and points at infinity, is an unexpectedly subtle one. Due to the fact that whether or not two boundary points are identified or even…

A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find…

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

We study unitary random matrix ensembles in the critical case where the limiting mean eigenvalue density vanishes quadratically at an interior point of the support. We establish universality of the limits of the eigenvalue correlation…

The present paper is concerned with diffusion processes running on tubular domains with conditions on nonreaching the boundary, respectively, reflecting at the boundary, and corresponding processes in the limit where the thin tubular…