Displaying similar documents to “Identifiability of exchangeable sequences with identically distributed partial sums.”

An improved result on irregularities in distribution of sequences of integers

John H. Hodges (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

In 1972 the author used a result of K.F. Roth on irregularities in distribution of sequences of real numbers to prove an analogous result related to the distribution of sequences of integers in prescribed residue classes. Here, a 1972 result of W.M. Schmidt, which is an improvement of Roth's result, is used to obtain an improved result for sequences of integers.

An improved result on irregularities in distribution of sequences of integers

John H. Hodges (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

In 1972 the author used a result of K.F. Roth on irregularities in distribution of sequences of real numbers to prove an analogous result related to the distribution of sequences of integers in prescribed residue classes. Here, a 1972 result of W.M. Schmidt, which is an improvement of Roth's result, is used to obtain an improved result for sequences of integers.

Some properties and applications of probability distributions based on MacDonald function

Oldřich Kropáč (1982)

Aplikace matematiky

Similarity:

In the paper the basic analytical properties of the MacDonald function (the modified Bessel function of the second kind) are summarized and the properties of some subclasses of distribution functions based on MacDonald function, especially of the types x n K n ( x ) , x ≥ 0 , x n K n ( x x ) , x ∈ 𝐑 and x n + 1 K n ( x ) , x ≥ 0 are discussed. The distribution functions mentioned are useful for analytical modelling of composed (mixed) distributions, especially for products of random variables having distributions of the exponential type. Extensive and...

Probability on Finite and Discrete Set and Uniform Distribution

Hiroyuki Okazaki (2009)

Formalized Mathematics

Similarity:

A pseudorandom number generator plays an important role in practice in computer science. For example: computer simulations, cryptology, and so on. A pseudorandom number generator is an algorithm to generate a sequence of numbers that is indistinguishable from the true random number sequence. In this article, we shall formalize the "Uniform Distribution" that is the idealized set of true random number sequences. The basic idea of our formalization is due to [15].

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

Similarity:

In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation...