Related papers: Universal Convergence of Semimeasures on Individua…
This paper studies the notion of W-measurable sensitivity in the context of semigroup actions. W-measurable sensitivity is a measurable generalization of sensitive dependence on initial conditions. In 2012, Grigoriev et. al. proved a…
We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…
In a recent letter [Phys. Rev. Lett. {\bf 100}, 164101 (2008)] and within the context of quantized chaotic billiards, random plane wave and semiclassical theoretical approaches were applied to an example of a relatively new class of…
We exhibit a one to one correspondence between some universal probabilistic properties of the ordering coordinate of one-dimensional Ising-like models and a class of continuous time random walks. This correspondence provides an new…
In this paper we collect several examples of convergence of functions of random processes to generalized functionals of those processes. We remark that the limit is always finitely absolutely continuous with respect to Wiener measure. We…
In the paper we prove the existence of probabilistic solutions to systems of the form $-Au=F(x,u)+\mu$, where $F$ satisfies a generalized sign condition and $\mu$ is a smooth measure. As for $A$ we assume that it is a generator of a Markov…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
Reimann and Slaman initiated the study of sequences that are Martin-L\"of random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of sequences that are not Martin-L\"of random with respect to…
We prove the existence of codebooks for d-semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive distortion measures. By…
A strong law of large numbers for $d$-dimensional random projections of the $n$-dimensional cube is derived. It shows that with respect to the Hausdorff distance a properly normalized random projection of $[-1,1]^n$ onto $\mathbb{R}^d$…
A metric measure space is a complete separable metric space equipped with probability measure that has full support. Two such spaces are equivalent if they are isometric as metric spaces via an isometry that maps the probability measure on…
We present conditions that allow us to pass from the convergence of probability measures in distribution to the uniform convergence of the associated quantile functions. Under these conditions, one can in particular pass from the asymptotic…
Consider random matrices $A$, of dimension $m\times (m+n)$, drawn from an ensemble with probability density $f(\rmtr AA^\dagger)$, with $f(x)$ a given appropriate function. Break $A = (B,X)$ into an $m\times m$ block $B$ and the…
Let $(\Omega,\mu)$ be a $\sigma$-finite measure space, and let $X\subset L^1(\Omega)+L^\infty(\Omega)$ be a fully symmetric space of measurable functions on $(\Omega,\mu)$. If $\mu(\Omega)=\infty$, necessary and sufficient conditions are…
In this paper, we address the problem of constructing a uniform probability measure on $\mathbb{N}$. Of course, this is not possible within the bounds of the Kolmogorov axioms and we have to violate at least one axiom. We define a…
A labelled Markov process (LMP) consists of a measurable space $S$ together with an indexed family of Markov kernels from $S$ to itself. This structure has been used to model probabilistic computations in Computer Science, and one of the…
We study the probability distribution function of the long-time values of observables being time-evolved by Hamiltonians modeling clean and disordered one-dimensional chains of many spin-1/2 particles. In particular, we analyze the return…
We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of…
We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…