Related papers: Pseudorandom sequences derived from automatic sequ…
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…
It is known that Kolmogorov-Arnold-Moser boundaries appear in sufficiently smooth 2-dimensional area-preserving maps. When such boundaries are destroyed, they become pseudo-boundaries. We show that pseudo-boundaries can also be found in…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
We consider coherent sublinear expectations on a measurable space, without assuming the existence of a dominating probability measure. By considering a decomposition of the space in terms of the supports of the measures representing our…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
We present a Gaussian ensemble of random cyclic matrices on the real field and study their spectral fluctuations. These cyclic matrices are shown to be pseudo-symmetric with respect to generalized parity. We calculate the joint probability…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
We provide a framework which admits a number of ``marginal'' sequential Monte Carlo (SMC) algorithms as particular cases -- including the marginal particle filter [Klaas et al., 2005, in: Proceedings of Uncertainty in Artificial…
Machine learning models are known to learn spurious correlations, i.e., features having strong relations with class labels but no causal relation. Relying on those correlations leads to poor performance in the data groups without these…
A novel generalization of the Prouhet-Thue-Morse sequence to binary $\pm 1$-weight sequences is presented. Derived from Rademacher functions, these weight sequences are shown to satisfy interesting orthogonality and recurrence relations. In…
Pseudoprocesses, constructed by means of the solutions of higher-order heat-type equations have been developed by several authors and many related functionals have been analyzed by means of the Feynman-Kac functional or by means of the…
We propose a convergence mode for positive Radon measures which allows a sequence of probability measures to have an improper limiting measure. We define a sequence of vague priors as a sequence of probability measures that converges to an…
Let $\underline{a}$ and $\underline{b}$ be primitive sequences over $\mathbb{Z}/(p^e)$ with odd prime $p$ and $e\ge 2$. For certain compressing maps, we consider the distribution properties of compressing sequences of $\underline{a}$ and…
Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…