Related papers: Intermediate Intrinsic Density and Randomness
Estimating the ratio of two probability densities from finitely many samples, is a central task in machine learning and statistics. In this work, we show that a large class of kernel methods for density ratio estimation suffers from error…
We introduce the notion of density of a rational language with respect to a sequence of probability measures. We prove that if $(\mu_n)$ is a sequence of Bernoulli measures converging to a positive Bernoulli measure $\overline{\mu}$, the…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
We perform a deeper analysis of an axiomatic approach to the concept of intrinsic dimension of a dataset proposed by us in the IJCNN'07 paper (arXiv:cs/0703125). The main features of our approach are that a high intrinsic dimension of a…
Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
The spectral representation separates the contributions of geometrical arrangement (topology) and intrinsic constituent properties in a composite. The aim of paper is to present a numerical algorithm based on the Monte Carlo integration and…
We introduce the two-particle probability density $X(x)$ of $x=\bm{r}_{12}\cdot\bm{p}_{12}=\left(\bm{r}_1-\bm{r}_2\right) \cdot \left(\bm{p}_1-\bm{p}_2\right)$. We show how to derive $X(x)$, which we call the Posmom intracule, from the…
We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…
We define a general method for finding a quasi-best approximant in sup-norm to a target density belonging to a given model, based on independent samples drawn from distributions which average to the target (which does not necessarily belong…
Suppose $X_1,\dots, X_n$ is a random sample from a bounded and decreasing density $f_0$ on $[0,\infty)$. We are interested in estimating such $f_0$, with special interest in $f_0(0)$. This problem is encountered in various statistical…
Random number has many applications, it plays an important role in quantum information processing. It's not difficult to generate true random numbers, the main difficulty is how to certify the random numbers generated by untrusted devices.…
The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal.
Parametric density estimation, for example as Gaussian distribution, is the base of the field of statistics. Machine learning requires inexpensive estimation of much more complex densities, and the basic approach is relatively costly…
This paper proves the existence of nonmeasurable dense sets with additional properties using combinatorial techniques.
For a real number $q>1$ and a positive integer $m$, let $Y_m(q):={\sum_{i=0}^n\epsilon_i q^i:\; \epsilon_i\in \{0, \pm 1,..., \pm m\}, n=0, 1,...}.$ In this paper, we show that $Y_m(q)$ is dense in ${\Bbb R}$ if and only if $q<m+1$ and $q$…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
In order to consider j-wise relative r-primality conditions that do not necessarily require all j-tuples of elements in a Dedekind domain to be relatively r-prime, we define the notion of j-wise relative r-primality with respect to a fixed…
The probability that a randomly chosen element of a finite group is an $r$--th root (for any integer $r\geq2$) has been studied largely in case $r=2$. Certain techniques may be generalized for $r>2$ and here we find the exact value of this…
We outline an efficient method for the reconstruction of a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtained resorting to maximum entropy technique, under the…