Results 11 to 20 of about 5,148,982 (304)

Complete convergence for weighted sums of arrays of random elements [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1983
Let {Xnk:k,n=1,2,…} be an array of row-wise independent random elements in a separable Banach space. Let {ank:k,n=1,2,…} be an array of real numbers such that ∑k=1∞|ank|≤1 and ∑n=1∞exp(−α/An)
Robert Lee Taylor
doaj   +3 more sources

Strong laws of large numbers for arrays of row-wise exchangeable random elements [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1985
Let {Xnk,1≤k≤n,n≤1} be a triangular array of row-wise exchangeable random elements in a separable Banach space.
Robert Lee Taylor   +1 more
doaj   +2 more sources

Strong previsions of random elements

open access: yesStatistical Methods & Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BERTI P.   +2 more
openaire   +4 more sources

Stochastic finite element method with simple random elements [PDF]

open access: yes, 2008
We propose a variant of the stochastic finite element method, where the random elements occuring in the problem formulation are approximated by simple random elements, i.e.
Starkloff, Hans-Jörg
core   +3 more sources

Application of random elements in ISS

open access: yesIET Image Processing, 2020
The ‐threshold image secret sharing (ISS) encodes a secret image into n shares. When k or more shares are obtained, the secret image can be decoded; however, less than k ...
Xuehu Yan   +5 more
openaire   +1 more source

A Protocol for Generating Random Elements with Their Probabilities [PDF]

open access: yes, 2014
We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that ...
Holenstein Thomas, Künzler Robin
openaire   +4 more sources

Random walk with barycentric self-interaction [PDF]

open access: yes, 2011
We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory $(X_1,...,X_n)
Menshikov, Mikhail V.   +3 more
core   +3 more sources

Calibrating Dependence Between Random Elements [PDF]

open access: yesJournal of Theoretical Probability, 2020
Attempts to quantify dependence between random elements X and Y via maximal correlation go back to Gebelein (1941) and Rényi (1959). After summarizing properties (including some new) of the Rényi measure of dependence, a calibrated scale of dependence is introduced. It is based on the ``complexity`` of approximating functions of X by functions of Y.
Abram M. Kagan, Gábor J. Székely
openaire   +3 more sources

Large deviations for heavy-tailed random elements in convex cones [PDF]

open access: yes, 2014
We prove large deviation results for sums of heavy-tailed random elements in rather general convex cones being semigroups equipped with a rescaling operation by positive real numbers.
Molchanov, Ilya, Kopp, Christoph Peter
core   +1 more source

On Properties of Polynomials in Random Elements [PDF]

open access: yesTheory of Probability & Its Applications, 2016
This paper deals with different properties of polynomials in random elements: bounds for characteristic functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, the characterization problem, and bounds for probabilities to hit the balls.
openaire   +3 more sources

Home - About - Disclaimer - Privacy