English
Related papers

Related papers: Covering one point process with another

200 papers

The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open,…

Statistical Mechanics · Physics 2018-04-26 Michał Cieśla , Robert M. Ziff

The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…

Probability · Mathematics 2015-06-26 Alexander Soshnikov

We consider an occupancy scheme in which "balls" are identified with $n$ points sampled from the standard exponential distribution, while the role of "boxes" is played by the spacings induced by an independent random walk with positive and…

Probability · Mathematics 2009-09-01 Alexander V. Gnedin , Alexander M. Iksanov , Pavlo Negadajlov , Uwe Rösler

Encouraged by the study of extremal limits for sums of the form $$\lim_{N\to\infty}\frac{1 }{N}\sum_{n=1}^N c(x_n,y_n)$$ with uniformly distributed sequences $\{x_n\},\,\{y_n\}$ the following extremal problem is of interest…

Optimization and Control · Mathematics 2015-02-25 Maria Rita Iacò , Stefan Thonhauser , Robert F. Tichy

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

Computational Geometry · Computer Science 2025-11-04 Ke Chen , Adrian Dumitrescu

This paper investigates asymptotic distribution of complex zeros of random polynomials $P_n(z):=\sum_{k=0}^{n}b(k)\xi_k z^k$, as $n\to\infty$, where $b$ is a regularly varying function at infinity with index $\alpha\in \mathbb{R}$ and…

Probability · Mathematics 2025-11-18 Zakhar Kabluchko , Boris Khoruzhenko , Alexander Marynych

We consider the classic Set Cover problem in the data stream model. For $n$ elements and $m$ sets ($m\geq n$) we give a $O(1/\delta)$-pass algorithm with a strongly sub-linear $\tilde{O}(mn^{\delta})$ space and logarithmic approximation…

Data Structures and Algorithms · Computer Science 2016-05-03 Sariel Har-Peled , Piotr Indyk , Sepideh Mahabadi , Ali Vakilian

Let $n,k,b$ be integers with $1 \le k-1 \le b \le n$ and let $G_{n,k,b}$ be the graph whose vertices are the $k$-element subsets $X$ of $\{0,\dots,n\}$ with $\max(X)-\min(X) \le b$ and where two such vertices $X,Y$ are joined by an edge if…

Combinatorics · Mathematics 2019-06-21 Konrad Engel , Sebastian Hanisch

Let X,X_1,X_2,... be independent identically distributed random variables and let h(x,y)=h(y,x) be a measurable function of two variables. It is shown that the bounded law of the iterated logarithm, $\limsup_n (n\log\log n)^{-1}|\sum_{1<=…

Probability · Mathematics 2014-11-17 Evarist Giné , Stanisław Kwapień , Rafał Latała , Joel Zinn

Kernel mean embeddings are a popular tool that consists in representing probability measures by their infinite-dimensional mean embeddings in a reproducing kernel Hilbert space. When the kernel is characteristic, mean embeddings can be used…

Machine Learning · Computer Science 2021-06-29 Boris Muzellec , Francis Bach , Alessandro Rudi

Let $X_1,\,X_2,\,\ldots,\,X_N$, $N\in\mathbb{N}$ be independent but not necessarily identically distributed discrete and integer-valued random variables. Assume that $X_1\geqslant m_1$, $X_2\geqslant m_2$, $\ldots$, $X_N\geqslant m_N$…

Probability · Mathematics 2024-10-18 Andrius Grigutis , Artur Nakliuda

Inspired by a question asked on the list {\tt mathfun}, we revisit {\em Kempner-like series}, i.e., harmonic sums $\sum' 1/n$ where the integers $n$ in the summation have ``restricted'' digits. First we give a short proof that $\lim_{k \to…

Number Theory · Mathematics 2024-03-25 Jean-Paul Allouche , Claude Morin

We consider products of independent random matrices with independent entries. The limit distribution of the expected empirical distribution of eigenvalues of such products is computed. Let $X^{(\nu)}_{jk},{}1\le j,r\le n$, $\nu=1,...,m$ be…

Probability · Mathematics 2011-04-27 Friedrich Götze , Alexander Tikhomirov

Given a compact planar region $A$, let $\tau_A$ be the (random) time it takes for the Johnson-Mehl tessellation of $A$ to be complete, i.e. the time it takes for $A$ to be fully covered by a spatial birth-growth process in $A$ with seeds…

Probability · Mathematics 2025-11-06 Mathew D. Penrose , Frankie Higgs

This paper concerns the derivation of radiative transfer equations for acoustic waves propagating in a randomly fluctuating half-space in the weak-scattering regime, and the study of boundary effects through an asymptotic analysis of the…

Classical Physics · Physics 2022-12-01 Adel Messaoudi , Regis Cottereau , Christophe Gomez

We generalise the known fact that for binomial $X_{n,k} \sim \mathrm{Bin}(n, k/n)$ one has $\inf_{k>1,n} \mathrm{P}(X_{n,k} \geq k) \geq \lim_{k \to 1+}\mathrm{P}(X_{2,k} \geq k) = 1/4$ to cover probabilities of exceeding a constant shift…

Probability · Mathematics 2023-08-11 Tilo Wiklund

Let $G$ be a finite connected graph and let $G^{[\star N,k]}$ be the distance $k$-graph of the $N$-fold star power of $G$. For a fixed $k\geq1$, we show that the large $N$ limit of the spectral distribution of $G^{[\star N,k]}$ converges to…

Probability · Mathematics 2014-08-26 Octavio Arizmendi , Tulio Gaxiola

Let $X_1,X_2, \ldots $ be independent identically distributed random points in a convex polytopal domain $A \subset \mathbb{R}^d$. Define the largest nearest neighbour link $L_n$ to be the smallest $r$ such that every point of $\mathcal…

Probability · Mathematics 2023-01-09 Mathew D. Penrose , Xiaochuan Yang

If $x_1,\dots,x_m$ are finitely many points in $\mathbb{R}^d$, let $E_\epsilon=\cup_{i=1}^m\,x_i+Q_\epsilon$, where $Q_\epsilon=\{x\in \mathbb{R}^d,\,\,|x_i|\le \epsilon/2, \, i=1,...,d\}$ and let $\hat f$ denote the Fourier transform of…

Functional Analysis · Mathematics 2016-05-03 Jean-Pierre Gabardo , Chun-Kit Lai

A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…

Combinatorics · Mathematics 2008-12-03 Simon R. Blackburn , Stefanie Gerke