Related papers: Intermediate Intrinsic Density and Randomness
In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
For random piecewise linear systems T of the interval that are expanding on average we construct explicitly the density functions of absolutely continuous T-invariant measures. In case the random system uses only expanding maps our…
In this note, we study a class of random subsets of positive integers induced by Bernoulli random variables. We obtain sufficient conditions such that the random set is almost surely lacunary, does not have bounded gaps and contains…
Estimating the unknown density from which a given independent sample originates is more difficult than estimating the mean, in the sense that for the best popular non-parametric density estimators, the mean integrated square error converges…
If two random variables X and A are functionally related via f(X)=A for some strictly monotone continuously differentiable function f:R->R, the distribution of X may easily be computed from the distribution of A.
For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…
Motivated by giving a meaning to "The probability that a random integer has initial digit d", we define a URI-set as a random set E of natural integers such that each n>0 belongs to E with probability 1/n, independently of other integers.…
In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without…
Given i.i.d samples from some unknown continuous density on hyper-rectangle $[0, 1]^d$, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a…
We give a complete description of sampling and interpolation in the Bargmann-Fock space, based on a density concept of Beurling. Roughly speaking, a discrete set is a set of sampling if and only if its density in every part of the plane is…
This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients…
Weakly chaotic maps with unstable fixed points are investigated in the regime where the invariant density is non-normalizable. We propose that the infinite invariant density of these maps can be estimated using as the long time limit of…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
This brief paper develops a probability density that models processes for which the physical mechanism is unknown. It has desirable properties which are not realized by densities derived from Gaussian process or other classic methods. In…
Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…
In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases. However, we observe…
Randomness comes in two qualitatively different forms. Apparent randomness can result both from ignorance or lack of control of degrees of freedom in the system. In contrast, intrinsic randomness should not be ascribable to any such cause.…