Related papers: Discrete low-discrepancy sequences

Variable selection is a challenging issue in statistical applications when the number of predictors $p$ far exceeds the number of observations $n$. In this ultra-high dimensional setting, the sure independence screening (SIS) procedure was…

The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…

This work aims at making a comprehensive contribution in the general area of parametric inference for discretely observed diffusion processes. Established approaches for likelihood-based estimation invoke a time-discretisation scheme for…

Using some extensions of a theorem of Heppes on finitely supported discrete probability measures, we address the problems of classification and testing based on projections. In particular, when the support of the distributions is known in…

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

We show that the Simple Loop Conjecture holds for any representation $\rho\colon\pi_1(S)\longrightarrow \text{PSL}(2,\,\mathbb R)$ that is discrete but not faithful. That is, we show the existence of a simple closed curve in the kernel of…

Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…

The paper studies the higher-order absolute differences taken from progressive terms of time-homogenous binary Markov chains. Two theorems presented are the limiting theorems for these differences, when their order $k$ converges to…

For positive integers $d<k$ and $n$ divisible by $k$, let $m_{d}(k,n)$ be the minimum $d$-degree ensuring the existence of a perfect matching in a $k$-uniform hypergraph. In the graph case (where $k=2$), a classical theorem of Dirac says…

Let k be a global field, p an odd prime number different from char(k) and S, T disjoint, finite sets of primes of k. Let G_S^T(k)(p)=Gal(k_S^T(p)|k) be the Galois group of the maximal p-extension of k which is unramified outside S and…

Consider the triplet $(E, \mathcal{P}, \pi)$, where $E$ is a finite ground set, $\mathcal{P} \subseteq 2^E$ is a collection of subsets of $E$ and $\pi : \mathcal{P} \rightarrow [0,1]$ is a requirement function. Given a vector of marginals…

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

In 1976, Gallagher showed that the Hardy--Littlewood conjectures on prime $k$-tuples imply that the distribution of primes in log-size intervals is Poissonian. He did so by computing average values of the singular series constants over…

We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

A short proof of the classic Hardy inequality is presented for $p$-norms with $p>1$. Along the lines of this proof a sharpened version is proved of a recent generalization of Hardy's inequality in the terminology of probability theory. A…

The authors transpose a discrete notion of indetermination coupling in the case of continuous probabilities. They show that this coupling, expressed on densities, cannot be captured by a specific copula which acts on cumulative distribution…

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…