Related papers: Algorithmic randomness in harmonic analysis
In this paper, the weak convergence of additive functionals of processes with locally independent increments and with Markov switching in the scheme of Poisson approximation is proved. For the relative compactness, a method proposed by R.…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
It is conjectured that the eigenvalues of random Schrodinger operators at the localization transition in dimensions d>=2 behave like the eigenvalues of the Gaussian Orthogonal Ensemble (GOE). We show that there are sequences of n by m boxes…
This is a comment on the article "Probabilistic Integration: A Role in Statistical Computation?" by F.-X. Briol, C. J. Oates, M. Girolami, M. A. Osborne and D. Sejdinovic to appear in Statistical Science. There is a role for statistical…
Weak convergence of various general functionals of partial sums of dependent random variables to stochastic integral now play a major role in the modern statistics theory. In this paper, we obtain the weak convergence of various general…
Let G_<(n,p) denote the usual random graph G(n,p) on a totally ordered set of n vertices. We will fix p=1/2 for definiteness. Let L^< denote the first order language with predicates equality (x=y), adjacency (x~y) and less than (x<y). For…
We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…
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…
A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent…
A famous theorem of Carleson says that, given any function $f\in L^p(\TT)$, $p\in(1,+\infty)$, its Fourier series $(S_nf(x))$ converges for almost every $x\in \mathbb T$. Beside this property, the series may diverge at some point, without…
We strengthen the Carleson-Hunt theorem by proving $L^p$ estimates for the $r$-variation of the partial sum operators for Fourier series and integrals, for $p>\max\{r',2\}$. Four appendices are concerned with transference, a variation norm…
Urbanik's theorem for a Poisson process on an infinite measure space (X, A, $\mu$) relates integrability of stochastic integrals to a particular Orlicz function space L$\Phi$ ($\mu$) on which the L1-norm of the Poisson process induces a…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error.…
In a seminal 2005 paper, Haagerup and Thorbj{\o}rnsen discovered that the norm of any noncommutative polynomial of independent complex Gaussian random matrices converges to that of a limiting family of operators that arises from…
We continue the study of random matrix universality in two-dimensional conformal field theories. This is facilitated by expanding the spectral form factor in a basis of modular invariant eigenfunctions of the Laplacian on the fundamental…
Let $E\subset \mathbb{R}^{n+1}$, $n\ge 2$, be a uniformly rectifiable set of dimension $n$. Then bounded harmonic functions in $\Omega:= \mathbb{R}^{n+1}\setminus E$ satisfy Carleson measure estimates, and are "$\varepsilon$-approximable".…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
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…
We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…