In this paper a notion of statistical independence of sequences of integers is developed. The results are generalizations of known results on independent sequences modm in the integers and more generally, independent sequences on compact sets. All that is assumed is that one has a countable partition of the integers indexed by an ordered set
The aim of the bachelor's thesis was to explore the independence of random events in greater depth a...
summary:We characterize statistical independence of sequences by the $L^p$-discrepancy and the Wiene...
AbstractLet it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and ...
ABSTRACT. In this paper a notion of statistical independence of sequences of integers is developed. ...
AbstractTwo objects are independent if they do not affect each other. Independence is well-understoo...
AbstractThis paper examines statistical independence in finite sets. By considering the structure of...
Nefunkční DOIThe classical probability that a randomly chosen number from the set {n ∈ N : n ≤ n0} b...
AbstractIn the present paper we investigate properties of a general notion of independence and we us...
I will give a broad review of classes of integer sequences arising in combinatorics. Beside the mor...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractA nonparametric test of the mutual independence between many numerical random vectors is pro...
International audienceA nonparametric test of the mutual independence between many numerical random ...
Contains fulltext : 129157.pdf (publisher's version ) (Open Access
The paper deals with the so-called linearly unrelated se-quences. The criterion and the application ...
The aim of the bachelor's thesis was to explore the independence of random events in greater depth a...
summary:We characterize statistical independence of sequences by the $L^p$-discrepancy and the Wiene...
AbstractLet it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and ...
ABSTRACT. In this paper a notion of statistical independence of sequences of integers is developed. ...
AbstractTwo objects are independent if they do not affect each other. Independence is well-understoo...
AbstractThis paper examines statistical independence in finite sets. By considering the structure of...
Nefunkční DOIThe classical probability that a randomly chosen number from the set {n ∈ N : n ≤ n0} b...
AbstractIn the present paper we investigate properties of a general notion of independence and we us...
I will give a broad review of classes of integer sequences arising in combinatorics. Beside the mor...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractA nonparametric test of the mutual independence between many numerical random vectors is pro...
International audienceA nonparametric test of the mutual independence between many numerical random ...
Contains fulltext : 129157.pdf (publisher's version ) (Open Access
The paper deals with the so-called linearly unrelated se-quences. The criterion and the application ...
The aim of the bachelor's thesis was to explore the independence of random events in greater depth a...
summary:We characterize statistical independence of sequences by the $L^p$-discrepancy and the Wiene...
AbstractLet it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and ...
DOI
Add to ORKG