Related papers: Partially complete sufficient statistics are joint…
We review a finite-sampling exponential bound due to Serfling and discuss related exponential bounds for the hypergeometric distribution. We then discuss how such bounds motivate some new results for two-sample empirical processes. Our…
In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…
In recent years, partially observable functional data has gained significant attention in practical applications and has become the focus of increasing interest in the literature. In this thesis, we build upon the concept of data…
V.I. Arnold has experimentally established that the limit of the statistics of incomplete quotients of partial continued fractions of quadratic irrationalities coincides with the Gauss--Kuz'min statistics. Below we briefly prove this fact…
We present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…
The aim of this paper is to discus the relations between various notions of sequential completeness and the corresponding notions of completeness by nets or by filters in the setting of quasi-metric spaces. We propose a new definition of…
Some of my previous publications were incomplete in the sense that non trivial zeros belonging to a particular type of fundamental domain have been inadvertently ignored. Due to this fact, I was brought to believe that computations done by…
Two longest-run statistics are studied: the longest run of a fixed value and the longest run over all values. Under quantitative mixing and exponential cylinder estimates for constant words, a general theorem is proved. Quantitative…
To the frequentist who computes posteriors, not all priors are useful asymptotically: in this paper Schwartz's 1965 Kullback-Leibler condition is generalised to enable frequentist interpretation of convergence of posterior distributions…
This paper re-examines the first normalized incomplete moment, a well-established measure of inequality with wide applications in economic and social sciences. Despite the popularity of the measure itself, existing statistical inference…
An effective two-stage method for an estimation of parameters of the linear regression is considered. For this purpose we introduce a certain quasi-estimator that, in contrast to usual estimator, produces two alternative estimates. It is…
Wasserman et al. (2020, PNAS, vol. 117, pp. 16880-16890) constructed estimator agnostic and finite-sample valid confidence sets and hypothesis tests, using split-data likelihood ratio-based statistics. We demonstrate that the same approach…
The Duffin--Schaeffer Conjecture answers a question on how well one can approximate irrationals by rational numbers in reduced form (an imposed condition) where the accuracy of the approximation depends on the rational number. It can be…
In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…
The majority of the statisticians concluded many decades ago that fiducial inference was nonsensical to them. Hannig et al. (2016) and others have, however, contributed to a renewed interest and focus. Fiducial inference is similar to…
A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…
We give several results related to inhomogeneous approximations to two real numbers and badly approximable numbers. Our results are related to classical theorems by A. Khintchine (1926) and to an original method invented by Y. Peres and W.…
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
We prove an analogue of the weak Omori-Yau maximum principle and Khas'minskii's criterion for graphs in the general setting of Keller and Lenz. Our approach naturally gives the stability of stochastic incompleteness under certain surgeries…