Related papers: Solovay reducibility implies S2a-reducibility
Sample average approximation (SAA) is a widely popular approach to data-driven decision-making under uncertainty. Under mild assumptions, SAA is both tractable and enjoys strong asymptotic performance guarantees. Similar guarantees,…
Self-similarity of systems is very popular and intensively developing field during last decades. To this field belong so-called stable distributions and their generalization. In Klebanov and Sl\'amov\'a (2014) there was given an approach to…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
This paper is a contribution to the growing investigation of strong reducibilities between $\Pi^1_2$ statements of second-order arithmetic, viewed as an extension of the traditional analysis of reverse mathematics. We answer several…
The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate…
The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…
We address the study of topologically invariant means and almost convergence on the real numbers $\mathbb{R}$. Here, the former is a certain class of invariant means on $L^{\infty}(\mathbb{R})$ and the latter is a summability method defined…
We correct Miyabe's proof of van Lambalgen's Theorem for truth-table Schnorr randomness (which we will call uniformly relative Schnorr randomness). An immediate corollary is one direction of van Lambalgen's theorem for Schnorr randomness.…
Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov-Sinai entropy from the setting of amenable groups. Some parts…
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…
Avila's Almost Reducibility Conjecture (ARC) is a powerful statement linking purely analytic and dynamical properties of analytic one frequency $SL(2,\mathbb{C})$ cocycles. It is also a fundamental tool in the study of spectral theory of…
Robust Bayesian analysis has been mainly devoted to detecting and measuring robustness w.r.t. the prior distribution. Many contributions in the literature aim to define suitable classes of priors which allow the computation of variations of…
In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…
We establish the fundamental limits of lossless analog compression by considering the recovery of arbitrary m-dimensional real random vectors x from the noiseless linear measurements y=Ax with n x m measurement matrix A. Our theory is…
In the paper [G.Pantsulaia, On Uniformly Distributed Sequences on [-1/2,1/2], Georg. Inter. J. Sci. Tech.,4(3) (2013), 21--27], it was shown that $\mu$-almost every element of $\mathbf{R}^{\infty}$ is uniformly distributed in…
We consider one-frequency analytic SL(2,R) cocycles. Our main result establishes the Almost Reducibility Conjecture in the case of exponentially Liouville frequencies. Together with our earlier work, this implies that all cocycles close to…
Distance covariance is a quantity to measure the dependence of two random vectors. We show that the original concept introduced and developed by Sz\'{e}kely, Rizzo and Bakirov can be embedded into a more general framework based on symmetric…
A complete analysis is given of the computable reductions that hold between $\mathsf{SRT}^2_2$, $\mathsf{SPT}^2_2$, and $\mathsf{SIPT}^2_2$. In particular, while $\mathsf{D}^2_2\le_{\rm sW}\mathsf{SIPT}^2_2\le_{\rm…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We extend to the matrix setting a recent result of Srivastava-Vershynin about estimating the covariance matrix of a random vector. The result can be in- terpreted as a quantified version of the law of large numbers for positive…