Related papers: Kac's Lemma and countable generators for actions o…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
We present a generalization of Hirschman's entropic uncertainty principle for locally compact abelian groups to unimodular locally compact quantum groups. As a corollary, we strengthen a well-known uncertainty principle for compact groups,…
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…
We propose a new method for the calculation of the statistical properties, as e.g. the entropy, of unknown generators of symbolic sequences. The probability distribution p(k) of the elements k of a population can be approximated by the…
We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…
We consider the distribution of the Galois groups $\operatorname{Gal}(K^{\operatorname{un}}/K)$ of maximal unramified extensions as $K$ ranges over $\Gamma$-extensions of $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We prove two properties of…
We derive some Quantum Central Limit Theorems for expectation values of macroscopically coarse-grained observables, which are functions of coarse-grained hermitean operators. Thanks to the hermicity constraints, we obtain positive-definite…
We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…
We prove a version of ergodic theorem for an action of an amenable group, where a F{\o} lner sequence needs not to be tempered. Instead, it is assumed that a function satisfies certain mixing condition.
We establish in this paper a new form of Pl\"unnecke-type inequalities for ergodic probability measure-preserving actions of any countable abelian group. Using a correspondence principle for product sets, this allows us to deduce lower…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We study common frequently hypercyclic vectors for countable families of weighted backward shifts acting on $\ell_p$ spaces, $1\leq p<\infty$. Using probabilistic techniques, we develop a general existence criterion, complemented by a…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…
Both in quantum theory and in general probabilistic theories, measurements with $n$ outcomes are modelled as $n$-tuples of \emph{effects} summing up to the unit effect. Why is this the case, and can this assumption be meaningfully relaxed?…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
In this paper, we investigate capacity preserving transformations and their ergodicity. We show that for any measurable transformation $\theta$ there always exists a $\theta$-invariant capacity. We investigate some limit properties under…
In this paper we study two types of means of the entries of a nonnegative matrix: the \emph{permanental mean}, which is defined using permanents, and the \emph{scaling mean}, which is defined in terms of an optimization problem. We explore…
We undertake a comprehensive study of measure equivalence between general locally compact, second countable groups, providing operator algebraic and ergodic theoretic reformulations, and complete the classification of amenable groups within…
The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…