Related papers: Multiple Recurrence and Algorithmic Randomness

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…

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…

The main theorem of this paper establishes a uniform syndeticity result concerning the multiple recurrence of measure-preserving actions on probability spaces. More precisely, for any integers $d,l\geq 1$ and any $\varepsilon > 0$, we prove…

We survey the localization theory of random Schr\"odinger operators with singular single-site distributions, focusing on two regimes: (i) H\"older-continuous laws, where quantitative Wegner estimates enable the classical multiscale analysis…

In this article we use techniques of proof mining to analyse a result, due to Yonghong Yao and Muhammad Aslam Noor, concerning the strong convergence of a generalized proximal point algorithm which involves multiple parameters. Yao and…

Quantum criticality in the presence of strong quenched randomness remains a challenging topic in modern condensed matter theory. We show that the topology and anomaly associated with average symmetry can be used to predict certain…

Within the framework of simple perturbation theory, recurrence time of quantum fidelity is related to the period of the classical motion. This indicates the possibility of recurrence in near integrable systems. We have studied such…

We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

In this paper we study ergodicity and mixing property of some measure preserving transformations on the Wiener space (W,H,\mu) which are generated by some random unitary operators defined on the Cameron-Martin space H.

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…

In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

In this work, we deal with an iteration method for approximating a fixed point of a contraction mapping using the Mann's algorithm under functional random errors. We first show its almost complete convergence to the fixed point by mean of…

In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the…

The purpose of this note is twofold. In the first part we observe that two finitely generated non-amenable groups are quasi-isometric if and only if they admit topologically orbit equivalent Cantor minimal actions. In particular, free…

We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure $\mu$ on the space of infinite bit sequences is ML absolutely continuous if the non-ML-random bit sequences form a null set with…

Power-law uniform (in the operator norm) convergence on vector subspaces with their own norms in von Neumann's ergodic theorem with continuous time is considered. All possible exponents of the considered power-law convergence are found; for…

The RFMP is an iterative regularization method for a class of linear inverse problems. It has proved to be applicable to problems which occur, for example, in the geosciences. In the early publications [Fischer2011] and [FischerMichel2012],…

We consider finitely generated free semigroup actions on a compact metric space and obtain quantitative information on Poincar\'e recurrence, average first return time and hitting frequency for the random orbits induced by the semigroup…