English
Related papers

Related papers: Probabilistic Lower Bounds for the Discrepancy of …

200 papers

Given any full rank lattice and a natural number N , we regard the point set given by the scaled lattice intersected with the unit square under the Lambert map to the unit sphere, and show that its spherical cap discrepancy is at most of…

Numerical Analysis · Mathematics 2023-09-18 Damir Ferizović

The spherical cap discrepancy is a prominent measure of uniformity for sets on the d-dimensional sphere. It is particularly important for estimating the integration error for certain classes of functions on the sphere. Building on a…

Combinatorics · Mathematics 2025-04-09 Holger Heitsch , René Henrion

In this paper we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known. In particular, we address the case where…

Information Theory · Computer Science 2019-09-04 Ian Blanes , Miguel Hernández-Cabronero , Joan Serra-Sagristà , Michael W. Marcellin

We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…

Quantum Physics · Physics 2018-01-12 Kenji Nakahira , Tsuyoshi Sasaki Usuda , Kentaro Kato

We derive bounds for the ball $L_p$-discrepancies in the Hamming space for $0<p<\infty$ and $p=\infty$. Sharp estimates of discrepancies have been obtained for many spaces such as the Euclidean spheres and more general compact Riemannian…

Metric Geometry · Mathematics 2020-08-31 Alexander Barg , Maxim Skriganov

We extend the notion of jittered sampling to arbitrary partitions and study the discrepancy of the related point sets. Let $\mathbf{\Omega}=(\Omega_1,\ldots,\Omega_N)$ be a partition of $[0,1]^d$ and let the $i$th point in $\mathcal{P}$ be…

Statistics Theory · Mathematics 2021-02-01 Markus Kiderlen , Florian Pausinger

The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…

Numerical Analysis · Mathematics 2014-02-19 Aicke Hinrichs , Lev Markhasin

For 100 years since galaxies were found to be flying apart from each other, astronomers have been trying to determine how fast. The expansion, characterized by the Hubble constant, H0, is confused locally by peculiar velocities caused by…

Cosmology and Nongalactic Astrophysics · Physics 2023-05-23 R. Brent Tully

1. We find that any two distance moduli measurements for the same galaxy differ from each other by 2.07 times the reported one sigma uncertainty on average. 2. This average difference between distance moduli measurements of the same galaxy…

Cosmology and Nongalactic Astrophysics · Physics 2021-11-16 Ritesh Singh

There is an approximately 9% discrepancy, corresponding to 2.4sigma, between two independent constraints on the expansion rate of the universe: one indirectly arising from the cosmic microwave background and baryon acoustic oscillations,…

Cosmology and Nongalactic Astrophysics · Physics 2013-06-17 Valerio Marra , Luca Amendola , Ignacy Sawicki , Wessel Valkenburg

Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n…

Computation · Statistics 2018-06-14 Simon Wessing

Points in the unit cube with low discrepancy can be constructed using algebra or, more recently, by direct computational optimization of a criterion. The usual $L_\infty$ star discrepancy is a poor criterion for this because it is…

Numerical Analysis · Mathematics 2025-08-08 François Clément , Nathan Kirk , Art B. Owen , T. Konstantin Rusch

Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…

Methodology · Statistics 2025-06-06 Xu He , Junpeng Gong , Zhaohui Li

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

Combinatorics · Mathematics 2017-01-18 Matthew Kwan , Benny Sudakov

The construction and implementation of atmospheric model grids is a popular tool in exoplanet characterisation. These typically vary a number of parameters linearly, containing one model for every combination of parameter values. Here we…

Earth and Planetary Astrophysics · Physics 2022-08-03 Chloe Fisher , Kevin Heng

Building upon the exact methods presented in our earlier work [J. Complexity, 2022], we introduce a heuristic approach for the star discrepancy subset selection problem. The heuristic gradually improves the current-best subset by replacing…

Computational Geometry · Computer Science 2024-03-11 François Clément , Carola Doerr , Luís Paquete

There are irreducible differences between the Hubble constant measured locally and the global value. They are due to density perturbations and finite sample volume (cosmic variance) and finite number of objects in the sample (sampling…

Astrophysics · Physics 2009-10-30 Xiangdong Shi , Michael S. Turner

Magnitude predictions of $\Lambda$CDM, as parametrized by the Planck collaboration, are not consistent with the supernova data of the whole Pantheon+ sample even when, in order to take into account the uncertainty about its value, the…

Cosmology and Nongalactic Astrophysics · Physics 2024-12-03 Yves-Henri Sanejouand

We establish the existence of $N$-point sets in dimension $d$ whose star-discrepancy is bounded above by $2.4631832 \sqrt{\frac{d}{N}}$, where the numerical constant improves upon all previously known bounds. This improvement is obtained by…

Number Theory · Mathematics 2026-01-08 Christian Weiß

Sample complexity of bias estimation is a lower bound on the runtime of any bias detection method. Many regulatory frameworks require the bias to be tested for all subgroups, whose number grows exponentially with the number of protected…

Machine Learning · Computer Science 2025-02-06 German Martinez Matilla , Jakub Marecek