Related papers: Algorithmic randomness in harmonic analysis
We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent,…
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
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…
We prove a weak-$L^p$ bound for the Walsh-Carleson operator for $p $ near 1, improving on a theorem of Sjolin. We relate our result to the conjectures that the Walsh-Fourier and Fourier series of a function $f\in L\log L(\mathbb T)$…
We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…
We study generalizations of Demuth's Theorem, which states that the image of a Martin-L\"of random real under a tt-reduction is either computable or Turing equivalent to a Martin-L\"of random real. We show that Demuth's Theorem holds for…
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…
We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…
Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
Let $\psi:{\mathcal{D}}\rightarrow{\mathbf{R}}$ be a harmonic function such that $\Delta\psi(x)=0$ for all $x\in\mathcal{D}\subset{\mathbf{R}}^{n}$. There are then many well-established classical results:the Dirichlet problem and Poisson…
We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differentiable at z. Beyond these principal results, we show that a…
We consider several problems at or beyond endpoint in harmonic analysis. The solutions of these problems are related to the estimates of some classes of sublinear operators. To do this, we introduce some new functions spaces…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
Random Fourier features is a widely used, simple, and effective technique for scaling up kernel methods. The existing theoretical analysis of the approach, however, remains focused on specific learning tasks and typically gives pessimistic…
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.