Related papers: Simple and large equivalence relations

The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…

In this paper we study ergodic $\mathbb{Z}^r$-actions and investigate expansion properties along cyclic subgroups. We show that under some spectral conditions there are always directions which expand significantly a given measurable set…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

We consider a nonstationary random walk on a compact metrizable abelian group. Under a classical strict aperiodicity assumption we establish a weak-* convergence to the Haar measure, Ergodic Theorem and Large Deviation Type Estimate.

The existence of measure preserving invertible transformations $T$ with simple spectrum is established possessing the following rate of correlation decay $(f(T^k x), f(x)) = O(|k|^{-1/2+{\epsilon}})$ for a dense family of functions $f$ and…

Discourse relations bind smaller linguistic elements into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked sentences. A more subtle challenge…

We study mean ergodicity in amenable operator semigroups and establish the connection to the convergence of strong and weak ergodic nets. We then use these results in order to show the convergence of uniform families of ergodic nets that…

For a semifinite von Neumann algebra M, individual convergence of subsequential, \mathcal{Z}(M) (center of M) valued weighted ergodic averages are studied in noncommutative Orlicz spaces. In the process, we also derive a maximal ergodic…

We give a sufficient condition on nonlinearities of an SDE on a compact connected Riemannian manifold $M$ which implies that laws of all solutions converge weakly to the normalized Riemannian volume measure on $M$. This result is further…

We prove ergodicity for random dynamics satisfying some expansion and irreducibility conditions. As a particular application, we show that if $R_1,R_2\in \mathrm{SO}(d+1)$, $d\ge 2$, generate a dense subgroup, then the random dynamics of…

We prove ergodicity in a class of skew-product extensions of interval exchange transformations given by cocycles with logarithmic singularities. This, in particular, gives explicit examples of ergodic $\mathbb{R}$-extensions of minimal…

In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…

We prove a multidimensional ergodic theorem with weighted averages for the action of the group $\mathbb{Z}^d$ on a probability space. At level $n$ weights are of the form $n^{-d} \psi(j/n)$, $ j\in \mathbb{Z}^d$, for real functions $\psi$…

Entropic uncertainty relations are underpinning to compute the quantitative security bound in quantum cryptographic applications, such as quantum random number generation (QRNG) and quantum key distribution (QKD). All security proofs derive…

Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to…

We introduce a new information-theoretic formulation of quantum measurement uncertainty relations, based on the notion of relative entropy between measurement probabilities. In the case of a finite-dimensional system and for any approximate…

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

This thesis develops a new divergence that generalizes relative entropy and can be used to compare probability measures without a requirement of absolute continuity. We establish properties of the divergence, and in particular derive and…

We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…