English
Related papers

Related papers: Covering one point process with another

200 papers

The vertex-cover problem is studied for random graphs $G_{N,cN}$ having $N$ vertices and $cN$ edges. Exact numerical results are obtained by a branch-and-bound algorithm. It is found that a transition in the coverability at a $c$-dependent…

Statistical Mechanics · Physics 2007-05-23 Alexander K. Hartmann , Martin Weigt

A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…

Probability · Mathematics 2010-03-23 Martin Bender

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…

Computational Geometry · Computer Science 2016-03-24 Peyman Afshani , Edvin Berglin , Ingo van Duijn , Jesper Sindahl Nielsen

Extreme value theory is part and parcel of any study of order statistics in one dimension. Our aim here is to consider such large sample theory for the maximum distance to the origin, and the related maximum "interpoint distance," in…

Probability · Mathematics 2015-10-30 Sreenivasa Rao Jammalamadaka , Svante Janson

We consider the product of \(k_{n}\) independent \(n\times n\) complex Ginibre matrices and denote its eigenvalues by \(Z_{1},\ldots ,Z_{n}\). Let \(\alpha = \lim_{n\to\infty} n / k_{n}\). Using the determinantal point process method, we…

Probability · Mathematics 2026-04-16 Yutao Ma , Xujia Meng

Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…

Statistical Mechanics · Physics 2015-05-28 Thierry Huillet

We prove a lower bound on the eigenvalues $\lambda_k$, $k\in\mathbb{N}$, of the Dirichlet Laplacian of a bounded domain $\Omega\subset\mathbb{R}^n$ of volume $V$: $$ \lambda_k \geq C_n\bigg( \delta\frac{k}{V}\bigg)^{2/n} $$ where $\delta$…

Spectral Theory · Mathematics 2015-12-29 Neal Coleman

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

Probability · Mathematics 2026-04-10 Steven Hoehner , Christoph Thäle

Let $\lambda$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $\lambda$ at random. They obtained limiting…

Probability · Mathematics 2014-07-15 Ljuben Mutafchiev

We investigate a two-dimensional statistical model of N charged particles interacting via logarithmic repulsion in the presence of an oppositely charged compact region K whose charge density is determined by its equilibrium potential at an…

Classical Analysis and ODEs · Mathematics 2012-07-04 Christopher D. Sinclair , Maxim L. Yattselev

We establish the limiting distribution of $\frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{n\le x}\alpha(n)$ where $\alpha$ is a Steinhaus random multiplicative function, answering a question of Harper. The distributional convergence is proved…

Number Theory · Mathematics 2025-09-16 Ofir Gorodetsky , Mo Dick Wong

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most…

Combinatorics · Mathematics 2021-01-29 Anurag Bishnoi , Simona Boyadzhiyska , Shagnik Das , Tamás Mészáros

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

Representation Theory · Mathematics 2025-10-27 Ewan Cassidy

In this paper, explicit error bounds are derived in the approximation of rank $k$ projections of certain $n$-dimensional random vectors by standard $k$-dimensional Gaussian random vectors. The bounds are given in terms of $k$, $n$, and a…

Probability · Mathematics 2007-06-07 Elizabeth Meckes

We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…

Statistical Mechanics · Physics 2007-05-23 F. Hivert , S. Nechaev , G. Oshanin , O. Vasilyev

Let $X$ be a finite-area non-compact hyperbolic surface. We study the spectrum of the Laplacian on random covering surfaces of X and on random unitary bundles over X. We show that there is a constant $c > 0$ such that, with probability…

Spectral Theory · Mathematics 2024-05-09 Will Hide

We study the topology of a Ricci limit space $(X,p)$, which is the Gromov-Hausdorff limit of a sequence of complete $n$-manifolds $(M_i, p_i)$ with $\mathrm{Ric}\ge -(n-1)$. Our first result shows that, if $M_i$ has Ricci bounded covering…

Differential Geometry · Mathematics 2021-03-23 Jiayin Pan , Jikang Wang

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random…

Combinatorics · Mathematics 2019-11-12 Andrzej Dudek , Alan Frieze , Andrzej Ruciński , Matas Šileikis

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

Discrete Mathematics · Computer Science 2012-10-05 Niranjan Balachandran , Srimanta Bhattacharya
‹ Prev 1 3 4 5 6 7 10 Next ›