Results 231 to 240 of about 15,802 (259)
Some of the next articles are maybe not open access.
Weak Compactness of Random Sumsof Independent Random Variables
Theory of Probability & Its Applications, 1999The shift-compactness of random sums $S_{N_n}^{(n)}$, $S_k^{(n)}=X_{n,1}+\cdots +X_{n,k}$, of independent random variables is investigated under the assumptions that in each sum the summands and their number $N_n$ are independent and that the summands satisfy the condition of uniform asymptotic negligibility in the form $$ \max_{1\le k\le N_n}\bP\big\{|
openaire +2 more sources
ω-Change Randomness and Weak Demuth Randomness.
J. Symb. Log., 2014Accepted ...
Franklin, Johanna N. Y., Ng, Keng Meng
openaire +2 more sources
Security Weaknesses in a Randomized Stream Cipher
2000TriStrata appears to have implemented a variation of Maurer’s randomised cipher. We define a variation of Maurer’s cipher that appears to be similar to the TriStrata version, and show several cryptanalytical attacks against our variant.
Niels Ferguson +2 more
openaire +1 more source
Weak Mixing of Random Walks on Groups
Journal of Theoretical Probability, 2003Let \(\mu\) be a probability measure on a locally compact \(\sigma\)-compact group. The authors prove that a random walk associated with \(\mu\) is weakly mixing if and only if it is ergodic and strictly aperiodic. The proof is based on results on the eigenvalues of the associated transition operators.
openaire +1 more source
Random variables in weak typep spaces
Archiv der Mathematik, 1992Although weak type \(p\) spaces are introduced by geometric properties a characterization by the behaviour of random variables with values in these spaces is given which corresponds to the properties of type \(p\) spaces.
Defant, Martin, Junge, Marius
openaire +2 more sources
On weak convergence of random fields
Annals of the Institute of Statistical Mathematics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Davydov, Youri, Zitikis, Ričardas
openaire +2 more sources
Extractors for weak random sources and their applications
1998An extractor is an algorithm which, on input a long string from a defective random source and a short truly random string, outputs a long almost-random string. In this talk, we survey extractors for weak random sources and their applications.
openaire +1 more source
WEAK UNCORRELATEDNESS OF RANDOM VARIABLES
Acta Mathematica Scientia, 2006Abstract New measures of independence for n random variables, based on their moments, are studied. A scale of degrees of independence for random variables which starts with uncorrelatedness (for n = 2) and finishes at independence is constructed. The scale provides a countable linearly ordered set of measures of independence.
openaire +1 more source
Secrecy Without Perfect Randomness: Cryptography With (Bounded) Weak Sources
Lecture Notes in Computer Science, 2015Tim Ruffing, Michael Backes
exaly