Related papers: Multiple Recurrence and Algorithmic Randomness

In this paper we consider, in the general context of CAT(0) spaces, an iterative schema which alternates between Halpern and Krasnoselskii-Mann style iterations. We prove, under suitable conditions, the strong convergence of this algorithm,…

We characterize Martin-L\"of randomness and Schnorr randomness in terms of the merging of opinions, along the lines of the Blackwell-Dubins Theorem. After setting up a general framework for defining notions of merging randomness, we focus…

We prove a.e. convergence of continuous-time quadratic averages with respect to two commuting $\mathbb{R}$-actions, coming from a single jointly measurable measure-preserving $\mathbb{R}^2$-action on a probability space. The key ingredient…

This article presents a general approximation-theoretic framework to analyze measure transport algorithms for probabilistic modeling. A primary motivating application for such algorithms is sampling -- a central task in statistical…

In this paper, we extend the generalized Wiener-Wintner Theorem built by Host and Kra to the multilinear case under the hypothesis of pointwise convergence of multilinear ergodic averages. In particular, we have the following result: Let…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

By using a similar pattern of arguments, we show that in three categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at…

We make precise sense of the idea of "molecular chaos" through algorithmic randomness of microscopic trajectories, and ground macroscopic irreversibility in the lack of symmetry under time reversal of this property. This concept of…

$ \newcommand{\cclass}[1]{{\textsf{#1}}} $The classical Grothendieck inequality has applications to the design of approximation algorithms for $\cclass{NP}$-hard optimization problems. We show that an algorithmic interpretation may also be…

Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…

Area-preserving maps have been observed to undergo a universal period-doubling cascade, analogous to the famous Feigenbaum-Coullet-Tresser period doubling cascade in one-dimensional dynamics. A renormalization approach has been used by…

We prove a generalization of van der Corput's difference theorem for sequences of vectors in a Hilbert space. This generalization is obtained by establishing a connection between sequences of vectors in the first Hilbert space with a vector…

Optimization seeks extremal points in a function. When there are superextensively many optima, optimization algorithms are liable to get stuck. Under these conditions, generic algorithms tend to find marginal optima, which have many nearly…

We study the fluctuations of linear statistics with polynomial test functions for Multiple Orthogonal Polynomial Ensembles. Multiple Orthogonal Polynomial Ensembles form an important class of determinantal point processes that include…

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…

Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in…

A classical Borel Cantelli Lemma gives conditions for deciding whether an infinite number of rare events will almost surely happen. In this article, we propose an extension of Borel Cantelli Lemma to characterize the multiple occurrence of…

We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…

Algorithms for computing equilibria, optima, and fixed points in nonconvex problems often depend sensitively on practitioner-chosen initial conditions. When uniqueness of a solution is of interest, a common heuristic is to run such…

Let $T$ be an ergodic measure-preserving transformation on a non-atomic probability space $(X,\Sigma,\mu)$. We prove uniform extensions of the Wiener-Wintner theorem in two settings: For averages involving weights coming from Hardy field…