Related papers: Randomness extraction and asymptotic Hamming dista…
We show that the (truth-table) Medvedev degree KLR of Kolmogorov--Loveland randomness coincides with that of Martin L\"of randomness, MLR, answering a question of Miyabe. Next, an analogue of complex packing dimension is studied which gives…
We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…
We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…
In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…
In this paper non-asymptotic exact exponential estimates are derived (under minimal conditions) for the tail of deviation of the MLE distribution in the so-called natural terms: natural function, natural distance, metric entropy, Banach…
In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…
The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller…
This paper presents the asymptotic analysis of random lattices in high dimensions to clarify the distance properties of the considered lattices. These properties not only indicate the asymptotic value for the distance between any pair of…
We study the large deviations of Markov chains under the sole assumption that the state space is discrete. In particular, we do not require any of the usual irreducibility and exponential tightness assumptions. Using subadditive arguments,…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…
In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-L\"of random with respect to a Bernoulli measure $\mu_p$ for some $p\in[0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability…
We provide non-asymptotic bounds for first and higher order inclusion probabilities of the rejective sampling model with various size parameters. Further we derive bounds in the semi-definite ordering for matrices that collect (conditional)…
In this paper we study structural properties of LV-degrees of the algebra of collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. We construct atoms…
This paper establishes non-asymptotic convergence of the cutoffs in Random serial dictatorship in an environment with many students, many schools, and arbitrary student preferences. Convergence is shown to hold when the number of schools,…
We show that the displacement and translation distance of non-elementary random walks on isometry groups of hyperbolic spaces satisfy large deviation principles with the same rate function $I$. Roughly, this means that there exists function…
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…
We consider experimental routes to determine the nonclassical degree of states of a field mode. We adopt a distance-type criterium based on the Hilbert-Schmidt metric to quantify the nonclassicality. The concept of nonclassical degree is…