Related papers: Partially complete sufficient statistics are joint…
Logarithmic score and information divergence appear in both information theory, statistics, statistical mechanics, and portfolio theory. We demonstrate that all these topics involve some kind of optimization that leads directly to the use…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
An elementary proof of a quantitative version of the Riemann-Lebesgue lemma for functions supported on the half line is given. Applications to differential models with memory are discussed.
The purpose of this article is twofold: to prove a pointwise equidistribution theorem with an error rate for almost smooth functions, which strengthens the main result of Kleinbock, Shi and Weiss (2017); and to obtain a L\'evy-Khintchin…
Under the assumption that the approximating function $\psi$ is monotonic, the classical Khintchine-Groshev theorem provides an elegant probabilistic criterion for the Lebesgue measure of the set of $\psi$-approximable matrices in $\R^{mn}$.…
Bayesian methods are useful for statistical inference. However, real-world problems can be challenging using Bayesian methods when the data analyst has only limited prior knowledge. In this paper we consider a class of problems, called…
We defend a new theory of statistical evidence, which we call Robust Bayesianism (RB). We prove that, under widely accepted assumptions, RB entails the law of likelihood [Royall, 1997], the likelihood principle [Berger and Wolpert, 1988],…
A new iterative algorithm for solving initial data inverse problems from partial observations has been recently proposed in Ramdani, Tucsnak and Weiss [15]. Based on the concept of observers (also called Luenberger observers), this…
In the first part Busemann concavity as non-negative curvature is introduced and a bi-Lipschitz splitting theorem is shown. Furthermore, if the Hausdorff measure of a Busemann concave space is non-trivial then the space is doubling and…
We give a short proof of an improved version of the Effros Open Mapping Principle via a shift-compactness theorem (also with a short proof), involving `sequential analysis' rather than separability, deducing it from the Baire property in a…
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete. One of the main difficulties of the problem is the lack of…
The domain of validity of standard thermodynamics and Boltzmann-Gibbs statistical mechanics is discussed and then formally enlarged in order to hopefully cover a variety of anomalous systems. The generalization concerns {\it nonextensive}…
For many years I have taught an advanced statistical inference course for master's students using the text of Casella and Berger (2002). The book gives a comprehensive treatment of the core topics at a level that avoids measure theory while…
Two sets of high quality income data are analysed in detail, one set from the UK, one from the USA. It is firstly demonstrated that both a log-normal distribution and a Boltzmann distribution can give very accurate fits to both these data…
In 1914, Felix Hausdorff published an elegant proof that almost all numbers are simply normal in base 2. We generalize this proof to show that almost all numbers are normal. The result is arguably the most elementary proof for this theorem…
We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinability Theorem (1933), Godel-Carnap's Diagonal Lemma (1934), and Rosser's (strengthening of Godel's first) Incompleteness Theorem (1936), whose proofs resemble much and…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
Given a large dataset and an estimation task, it is common to pre-process the data by reducing them to a set of sufficient statistics. This step is often regarded as straightforward and advantageous (in that it simplifies statistical…