Related papers: Ornstein Isomorphism and Algorithmic Randomness
We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…
We define a one-parameter family of entropies, each assigning a real number to any probability measure on a compact metric space (or, more generally, a compact Hausdorff space with a notion of similarity between points). These entropies…
Macdonald processes are certain probability measures on two-dimensional arrays of interlacing particles introduced by Borodin and Corwin (arXiv:1111.4408 [math.PR]). They are defined in terms of nonnegative specializations of the Macdonald…
A zero-entropy system is said to be loosely Bernoulli if it can be induced from an irrational rotation of the circle. We provide a criterion for zero-entropy systems to be loosely Bernoulli that is compatible with mixing. Using these…
The Markov-Bernstein type inequalities between the norms of functions and of their derivatives are analysed for complex exponential polynomials. We establish a relation between the sharp constants in those inequalities and the stability…
Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…
We consider consistent dynamics for non-intersecting birth and death chains, originating from dualities of stochastic coalescing flows and one dimensional orthogonal polynomials. As corollaries, we obtain unified and simple probabilistic…
Recent mathematical investigations have shown that under very general conditions exponential mixing implies the Bernoulli property. As a concrete example of a statistical mechanics which is exponentially mixing we consider a Bernoulli shift…
Information diagram and the I-measure are useful mnemonics where random variables are treated as sets, and entropy and mutual information are treated as a signed measure. Although the I-measure has been successful in machine proofs of…
We prove that zeros and critical points of a random polynomial $p_N$ of degree $N$ in one complex variable appear in pairs. More precisely, if $p_N$ is conditioned to have $p_N(\xi)=0$ for a fixed $\xi \in \C\backslash\set{0},$ we prove…
The complexity of matrix multiplication is a central topic in computer science. While the focus has traditionally been on exact algorithms, a long line of literature also considers randomized algorithms, which return an approximate solution…
We use ideas from topological dynamics (amenability), combinatorics (structural Ramsey theory) and model theory (Fra\" {i}ss\' e limits) to study closed amenable subgroups $G$ of the symmetric group $S_\infty$ of a countable set, where…
I. M. Milin proposed, in his 1971 paper, a system of inequalities for the logarithmic coefficients of normalized univalent functions on the unit disk of the complex plane. This is known as the Lebedev-Milin conjecture and implies the…
A key goal in the design of probabilistic inference algorithms is identifying and exploiting properties of the distribution that make inference tractable. Lifted inference algorithms identify symmetry as a property that enables efficient…
We establish a multivariate empirical process central limit theorem for stationary $\R^d$-valued stochastic processes $(X_i)_{i\geq 1}$ under very weak conditions concerning the dependence structure of the process. As an application we can…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
Boltzmann introduced in the 1870's a logarithmic measure for the connection between the thermodynamical entropy and the probabilities of the microscopic configurations of the system. His entropic functional for classical systems was…
An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…
The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this work, we provide a family of…
We study the equilibrium behaviour of a two-sided topological Markov shift with a countable number of states. We assume the potential associated with this shift is Walters with finite first variation and that the shift is topologically…