Related papers: A sharp estimate of the discrepancy of a certain n…
We investigate the expected star discrepancy under a newly designed class of convex equivolume partition models. The main contributions are two-fold. First, we establish a strong partition principle for the star discrepancy, showing that…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
The inverse of the star-discrepancy problem asks for point sets $P_{N,s}$ of size $N$ in the $s$-dimensional unit cube $[0,1]^s$ whose star-discrepancy $D^\ast(P_{N,s})$ satisfies $$D^\ast(P_{N,s}) \le C \sqrt{s/N},$$ where $C> 0$ is a…
An effective radius of convergence is defined and computed for any truncated Taylor series. Applications to well known series are performed and is shown that a range of good coincidence for actual and approximative plot can always be found.…
Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of point sets. After providing an introduction which puts the calculation of discrepancy measures in a more general context, we focus on the…
The extremes of a stationary time series typically occur in clusters. A primary measure for this phenomenon is the extremal index, representing the reciprocal of the expected cluster size. Both a disjoint and a sliding blocks estimator for…
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
This paper studies the complexity of estimating Renyi divergences of discrete distributions: $p$ observed from samples and the baseline distribution $q$ known \emph{a priori}. Extending the results of Acharya et al. (SODA'15) on estimating…
Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…
We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…
We prove a discrepancy estimate related to the sequence of fractional parts of $b^n/n$. This improves an earlier result of Cilleruelo et al.
We introduce a new method to infer the posterior distribution for planet occurrence rates from radial-velocity (RV) observations. The approach combines posterior samples from the analysis of individual RV datasets of several stars, using…
For a skew normal random sequence, convergence rates of the distribution of its partial maximum to the Gumbel extreme value distribution are derived. The asymptotic expansion of the distribution of the normalized maximum is given under an…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
We study some notions of negative dependence of a sampling scheme that can be used to derive variance bounds for the corresponding estimator or discrepancy bounds for the underlying random point set that are at least as good as the…
This note presents sharp inequalities for deviation probability of a general quadratic form of a random vector \(\xiv\) with finite exponential moments. The obtained deviation bounds are similar to the case of a Gaussian random vector. The…
Geometric discrepancies are standard measures to quantify the irregularity of distributions. They are an important notion in numerical integration. One of the most important discrepancy notions is the so-called \emph{star discrepancy}.…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
We compute the rate of convergence of forward, backward and central finite difference $\theta$-schemes for linear PDEs with an arbitrary odd order spatial derivative term. We prove convergence of the first or second order for smooth and…