相关论文: Lowness notions, measure and domination
We study the signal detection problem in high dimensional noise data (possibly) containing rare and weak signals. Log-likelihood ratio (LLR) tests depend on unknown parameters, but they are needed to judge the quality of detection tests…
Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]
We prove a positive mass theorem for continuous Riemannian metrics in the Sobolev space $W^{2, n/2}_{\mathrm{loc}}(M)$. We argue that this is the largest class of metrics with scalar curvature a positive a.c. measure for which the positive…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…
Hippocratic randomness is defined in a similar way to Martin-Lof randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of…
We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.
This paper provides a new approach to proving generalizations of the F.&M. Riesz Theorem, for example, the result of Helson and Lowdenslager, the result of Forelli (and de Leeuw and Glicksberg), and more recent results of Yamagushi. We…
The normality measure $\mathcal{N}$ has been introduced by Mauduit and S{\'a}rk{\"o}zy in order to describe the pseudorandomness properties of finite binary sequences. Alon, Kohayakawa, Mauduit, Moreira and R{\"o}dl proved that the minimal…
We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…
The average result of a weak measurement of some observable $A$ can, under post-selection of the measured quantum system, exceed the largest eigenvalue of $A$. The nature of weak measurements, as well as the presence of post-selection and…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
The influence theorem for product measures on the discrete space {0,1}^N may be extended to probability measures with the property of monotonicity (which is equivalent to `strong positive-association'). Corresponding results are valid for…
We prove universal lower bounds for discrepancies (i.e. sizes of spectral gaps of averaging operators) of measure-preserving actions of a locally compact group on probability spaces. For example, a locally compact Hausdorff unimodular group…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
The Minkowski content of a compact set is a fine measure of its geometric scaling. For Lebesgue null sets it measures the decay of the Lebesgue measure of epsilon neighbourhoods of the set. It is well known that self-similar sets,…
In various analytical contexts, it is proved that a weak Sobolev inequality implies a doubling property for the underlying measure.
Some exact formulae of the expectation values and probability densities in a weak measurement for an operator ${\bf A}$ which satisfies the property ${\bf A}^{2}=1$ are derived. These formulae include all-order effects of the unitary…
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…