Related papers: Frequent universality criterion and densities
The question of how best to estimate a continuous probability density from finite data is an intriguing open problem at the interface of statistics and physics. Previous work has argued that this problem can be addressed in a natural way…
In classical density (or density-functional) estimation, it is standard to assume that the underlying distribution has a density with respect to the Lebesgue measure. However, when the data distribution is a mixture of continuous and…
The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…
Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with…
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat other domain attributes: as a random variable with a density…
One key issue in several astrophysical problems is the evaluation of the density probability function underlying an observational discrete data set. We here review two non-parametric density estimators which recently appeared in the…
We consider a new method for estimating the parameters of univariate Gaussian mixture models. The method relies on a nonparametric density estimator $\hat{f}_n$ (typically a kernel estimator). For every set of Gaussian mixture components,…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new…
We revisit the long-standing question of the relation between image appreciation and its statistical properties. We generate two different sets of random images well distributed along three measures of entropic complexity. We run a…
In the recent paper [17] the first experimental determination of the density matrix of a free electron beam has been reported. The employed method leads to a linear inverse problem with a positive semidefinite operator as unknown. The…
We find the microscopic spectral densities and the spectral correlators associated with multicritical behavior for both hermitian and complex matrix ensembles, and show their universality. We conjecture that microscopic spectral densities…
The local to global principle for densities is a very convenient tool proposed by Poonen and Stoll to compute the density of a given subset of the integers. In this paper we provide an effective criterion to find all higher moments of the…
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
Let $A$ be a finite, abelian group. We show that the density of $A$-extensions satisfying the Hasse norm principle exists, when the extensions are ordered by discriminant. This strengthens earlier work of Frei--Loughran--Newton \cite{FLN},…
Let $A$ be the product of an abelian variety and a torus defined over a number field $K$. Fix some prime number $\ell$. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…
We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algorithm when it…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…
We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both…
Consider a positive Borel measure on a locally compact group. We define a notion of uniform density for such a measure, which is based on a group invariant introduced by Leptin in 1966. We then restrict to unimodular amenable groups and to…