English
Related papers

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

200 papers

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Computational Physics · Physics 2009-10-30 Andre van Hameren , Ronald Kleiss , Jiri Hoogland

We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…

Optimization and Control · Mathematics 2018-09-24 D. Russell Luke

The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…

Functional Analysis · Mathematics 2017-10-02 Tomasz Kobos

Let $S_k(N)$ denote the space of cusp forms of even integer weight $k$ and level $N$. We prove an asymptotic for the Petersson trace formula for $S_k(N)$ under an appropriate condition. Using the non-vanishing of a Kloosterman sum involved…

Number Theory · Mathematics 2024-11-27 Jishu Das

We consider a linear ill-posed equation in the Hilbert space setting. Multiple independent unbiased measurements of the right hand side are available. A natural approach is to take the average of the measurements as an approximation of the…

Numerical Analysis · Mathematics 2021-09-01 Tim Jahn

Let $m\in\mathbb N_{\ge 2}$, and let $\mathcal K=\{K_\lambda: \lambda\in(0, 1/m]\}$ be a class of Cantor sets, where $K_{\lambda}=\{\sum_{i=1}^\infty d_i\lambda^i: d_i\in\{0,1,\ldots, m-1\}, i\ge 1\}$. We investigate in this paper the…

Dynamical Systems · Mathematics 2022-02-16 Kan Jiang , Derong Kong , Wenxia Li

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

Probability · Mathematics 2024-10-16 Ludovic Morin

We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not…

Probability · Mathematics 2015-09-30 Stephen DeSalvo , M. Puck Rombach

This paper provides new error bounds on "consistent" reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a…

Information Theory · Computer Science 2016-04-21 Laurent Jacques

We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…

Probability · Mathematics 2026-03-20 Arie Beresteanu , Behrooz Moosavi Rameznzadeh

Let $H$ be a random $k$-uniform $n$-vertex hypergraph where every $k$-tuple belongs to $H$ independently with probability $p$. We show that for some $\varepsilon_k > 0$, if $p \geq n^{-\varepsilon_k}$, then asymptotically almost surely $H$…

Combinatorics · Mathematics 2017-11-07 Michael Simkin

A problem originating with Erd\H{o}s and Silverman in the 1970s asks for the minimum integer $r(k)$ such that any set of $n \ge r(k)$ points in the plane has some $k$-subset with no right angles. The case $k=4$ has an interesting gap…

Combinatorics · Mathematics 2026-05-05 Peter J. Dukes

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

Let $A$ be the adjacency matrix of a uniformly random $d$-regular digraph on $n$ vertices, and suppose that $\min(d,n-d)\geq\lambda n$. We show that for any $\kappa \geq 0$, \[\mathbb{P}[s_n(A)\leq\kappa]\leq…

Probability · Mathematics 2020-08-12 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Discrete Mathematics · Computer Science 2020-11-10 Paxton Turner , Raghu Meka , Philippe Rigollet

This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a $n\times p$ random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is…

Statistics Theory · Mathematics 2018-05-01 Taposh Banerjee , Hamed Firouzi , Alfred O. Hero

Let $(n_k)_{k=1}^{\infty}$ be a lacunary sequence of integers. We show that if $\mu$ is a probability measure on $[0,1)$ such that $|\widehat{\mu}(t)|\leq c|t|^{-\eta}$, then for $\mu$-almost all $x$, the discrepancy $D_N(n_kx)$ satisfies…

Number Theory · Mathematics 2019-06-06 Niclas Technau , Agamemnon Zafeiropoulos

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…

Combinatorics · Mathematics 2014-03-18 Kai-Uwe Schmidt

We show that the lower bound for the optimal directional discrepancy with respect to the class of rectangles in $\mathbb{R}^2$ rotated in a restricted interval of directions $[-\theta, \theta]$ with $\theta < \frac{\pi}{4}$ is of the order…

Classical Analysis and ODEs · Mathematics 2022-09-27 Dmitriy Bilyk , Michelle Mastrianni

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from below by $ 2 \*\sigma - o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Probability · Mathematics 2008-05-14 Sandrine Peche , Alexander Soshnikov