English
Related papers

Related papers: A Lower Bound for the Discrepancy of a Random Poin…

200 papers

We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…

Probability · Mathematics 2022-12-22 Daniel M. Kane , Ilias Diakonikolas

The Komlos conjecture in discrepancy theory states that for some constant K and for any m by n matrix A whose columns lie in the unit ball there exists a +/- 1 vector x such that the infinity norm of Ax is bounded above by K. This…

Combinatorics · Mathematics 2013-08-05 Aleksandar Nikolov

A nonparametric anomalous hypothesis testing problem is investigated, in which there are totally n sequences with s anomalous sequences to be detected. Each typical sequence contains m independent and identically distributed (i.i.d.)…

Machine Learning · Computer Science 2016-12-15 Shaofeng Zou , Yingbin Liang , H. Vincent Poor , Xinghua Shi

Consistent sampling is a technique for specifying, in small space, a subset $S$ of a potentially large universe $U$ such that the elements in $S$ satisfy a suitably chosen sampling condition. Given a subset $\mathcal{I}\subseteq U$ it…

Data Structures and Algorithms · Computer Science 2014-04-21 Konstantin Kutzkov , Rasmus Pagh

In a broad class of sparse random constraint satisfaction problems(CSP), deep heuristics from statistical physics predict that there is a condensation phase transition before the satisfiability threshold, governed by one-step replica…

Probability · Mathematics 2023-12-14 Danny Nam , Allan Sly , Youngtak Sohn

The distortion-rate performance of certain randomly-designed scalar quantizers is determined. The central results are the mean-squared error distortion and output entropy for quantizing a uniform random variable with thresholds drawn…

Information Theory · Computer Science 2012-01-04 Vivek K Goyal

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

Metric Geometry · Mathematics 2015-12-09 Ferenc Fodor , Daniel Hug , Ines Ziebarth

Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $\lambda =\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the…

Combinatorics · Mathematics 2020-05-05 Aditya Potukuchi

We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…

Combinatorics · Mathematics 2024-09-20 Michael Gnewuch

For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…

Computational Geometry · Computer Science 2017-09-12 David Krieg

The probability that a random permutation in $S_n$ is a derangement is well known to be $\displaystyle\sum\limits_{j=0}^n (-1)^j \frac{1}{j!}$. In this paper, we consider the conditional probability that the $(k+1)^{st}$ point is fixed,…

Combinatorics · Mathematics 2022-01-13 Sam Gutmann , Mark Mixer , Steven Morrow

A random set $S$ is $p$-spread if, for all sets $T$, $$\mathbb{P}(S \supseteq T) \leq p^{|T|}.$$ There is a constant $C>1$ large enough that for every graph $G$ with maximum degree $D$, there is a $C/D$-spread distribution on…

Combinatorics · Mathematics 2024-08-26 Vikrant Ashvinkumar , Charles Kenney

The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus…

Combinatorics · Mathematics 2007-06-11 Pawel Pralat , Jacques Verstraete , Nicholas Wormald

In this paper, we consider the following $k$-dispersion problem. Given a set $S$ of $n$ points placed in the plane in a convex position, and an integer $k$ ($0<k<n$), the objective is to compute a subset $S'\subset S$ such that $|S'|=k$ and…

Computational Geometry · Computer Science 2022-05-05 Vishwanath R. Singireddy , Manjanna Basappa

It is conjectured since long that for any convex body $K \in \mathbb{R}^n$ there exists a point in the interior of $K$ which belongs to at least $2n$ normals from different points on the boundary of $K$. The conjecture is known to be true…

Metric Geometry · Mathematics 2023-09-07 A. Grebennikov , G. Panina

We start by providing a very simple and elementary new proof of the classical bound due to J. Beck which states that the spherical cap $\mathbb{L}_2$-discrepancy of any $N$ points on the unit sphere $\mathbb S^d$ in $\mathbb{R}^{d+1}$,…

Classical Analysis and ODEs · Mathematics 2025-02-25 Dmitriy Bilyk , Johann S. Brauchart

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Combinatorics · Mathematics 2026-03-31 Verónica Borrás-Serrano , Isabel Byrne , Anant Godbole , Nathaniel Veimau

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

Metric Geometry · Mathematics 2021-06-22 Gilles Bonnet , Anna Gusakova , Christoph Thäle , Dmitry Zaporozhets

In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\ast$ satisfies…

Number Theory · Mathematics 2013-02-19 Gerhard Larcher , Friedrich Pillichshammer

Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…

Computational Geometry · Computer Science 2010-02-24 Dieter Mitsche , Maria Saumell , Rodrigo I. Silveira