相关论文: Low for random reals and positive-measure dominati…

This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…

This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune-free…

One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., R^A = R)? Such sequences are call low for R.…

We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…

In this paper, we further study the concepts of hop domination and 2-step domination and introduce the concepts of restrained hop domination, total restrained hop domination, 2-step restrained domination, and total 2-step restrained…

We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.

We consider the sets of negatively associated (NA) and negatively correlated (NC) distributions as subsets of the space $\mathcal{M}$ of all probability distributions on $\mathbb{R}^n$, in terms of their relative topological structures…

We study the relationship between the Tor-regularity and the local-regularity over a positively graded algebra defined over a field which coincide if the algebra is a standard graded polynomial ring. In this case both are characterizations…

In the last fifteen the subset sampling method has often been used in reliability problems as a tool for calculating small probabilities. This method is extrapolating from an initial Monte Carlo estimate for the probability content of a…

We investigate the possibility of replacing the topology of convergence in probability with convergence in $L^1$. A characterization of continuous linear functionals on the space of measurable functions is also obtained.

We solve the problem of determining basic topological properties of flat samples by performing measurements on their outer edge. The global maximum of four probe resistances shows a characteristic behaviour, which is dependent on the genus…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

It is a well known general principle that the Fourier transform of a random measure is small, except at the zero frequency, in various senses for appropriate notions of randomness. In this note we develop analogues of this principle for two…

The domains of mesh functions are strict subsets of the underlying space of continuous independent variables. Spaces of partial maps between topological spaces admit topologies which do not depend on any metric. Such topologies…

Motivated by quantum thermodynamics we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action…

This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…

Let $\mathcal{M}(X,\mathcal{A},\mu)$ be the ring of all real-valued measurable functions constructed over a measure space $(X,\mathcal{A},\mu)$. A topology on $\mathcal{M}(X,\mathcal{A},\mu)$, called the {$F_\mu$-topology} weaker than the {…

We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L\"of random left-computably enumerable reals has a Friedberg numbering, as does the family of…