Related papers: Propagation of partial randomness
A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…
The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…
This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…
We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…
We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the…
We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…
In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…
We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
We extend the key notion of Martin-L\"of randomness for infinite bit sequences to the quantum setting, where the sequences become states of an infinite dimensional system. We work towards showing an analogy with the Levin-Schnorr theorem to…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
The Poisson distribution of order $k$ is a special case of a compound Poisson distribution. For $k=1$ it is the standard Poisson distribution. Our main result is a proof that for sufficiently small values of the rate parameter $\lambda$,…
In this article, we prove that for a convergent sequence of residually absolutely irreducible representations of the absolute Galois group of a number field $F$ with coefficients in a domain finite over a power series ring over a $p$-adic…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…
We consider the relationship between learnability of a "base class" of functions on a set $X$, and learnability of a class of statistical functions derived from the base class. For example, we refine results showing that learnability of a…
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…