Related papers: Algorithmic randomness in harmonic analysis

Benjamini, Yadin, and Yehudayoff (2007) showed that if the maximum degree of a graph $G$ is 'sub-logarithmic,' then the typical range of random $\mathbb Z$-homomorphisms is super-constant. Furthermore, they showed that there is a sharp…

Over the last decades, two distinct approaches have been instrumental to our understanding of the computational complexity of statistical estimation. The statistical physics literature predicts algorithmic hardness through local stability…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…

Since the seminal results by Avellaneda \& Lin it is known that elliptic operators with periodic coefficients enjoy the same regularity theory as the Laplacian on large scales. In a recent inspiring work, Armstrong \& Smart proved…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

We study discrete harmonic analysis associated with ultraspherical orthogonal functions. We establish weighted l^p-boundedness properties of maximal operators and Littlewood-Paley g-functions defined by Poisson and heat semigroups generated…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

The celebrated Carleson-Hunt theorem gives pointwise almost everywhere convergence for the Fourier series of a function in $L^p(\mathbb T)$. R. Oberlin, A. Seeger, T. Tao, C. Thiele and J. Wright (OSTTW) strengthened this theorem by proving…

We prove an algorithmic regularity lemma for $L_p$ regular matrices $(1 < p \leq \infty),$ a class of sparse $\{0,1\}$ matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who…

We prove essentially optimal $L^p(\mathbb{R})$-estimates for variational variants of the maximal Fourier multiplier operators considered by Bourgain in his work on pointwise convergence of polynomial ergodic averages. As a corollary of our…

Extending the rigorous presentation of the classical umbral calculus given by Rota and Taylor in 1994, the so-called partition polynomials are interpreted with the aim to point out the umbral nature of the Poisson random variables. Among…

Classical Schur analysis is intimately connected to the theory of orthogonal polynomials on the circle [Simon, 2005]. We investigate here the connection between multipoint Schur analysis and orthogonal rational functions. Specifically, we…

This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

An instability property of the Birkhoff's ergodic theorem and related asymptotic laws with respect to small violations of algorithmic randomness is studied. The Shannon--McMillan--Breiman theorem and all universal compression schemes are…

The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Gaussian noise model, and instead require a Poisson noise…

In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…

We provide a near-complete classification of the Lorentz spaces $\Lambda_{\varphi}$ for which the sequence $\{S_{n}\}_{n\in \mathbb{N}}$ of partial Fourier sums is almost everywhere convergent along lacunary subsequences. Moreover, under…

In this article we present a statistical version of the Candes-Tao restricted isometry property (SRIP for short) which holds in general for any incoherent dictionary which is a disjoint union of orthonormal bases. In addition, we show that,…