Results 251 to 260 of about 3,675,924 (300)

A Markov Evolving Random Field and Spliting Random Elements

Theory of Probability & Its Applications, 1993
See the review in Zbl 0766.60057.
Greenwood, P. E., Evstigneev, I. V.
openaire   +2 more sources

Convergence of random elements

2000
There are various kinds of convergence of random elements, important from the probabilistic viewpoint. Here we recall some of them. The main attention will be paid to the following types of convergence of random elements: 1) convergence almost surely (or convergence with probability one); 2) convergence in probability; 3)
V. V. Buldygin, A. B. Kharazishvili
openaire   +1 more source

Generating random elements of abelian groups

Random Structures & Algorithms, 2005
AbstractAlgorithms based on rapidly mixing Markov chains are discussed to produce nearly uniformly distributed random elements in abelian groups of finite order. Let A be an abelian group generated by set S. Then one can generate ϵ‐nearly uniform random elements of A using 4|S|log(|A|/ϵ) log(|A|) additions and the same number of random bits.
openaire   +1 more source

Elements of the Random Walk

2004
This book was originally published in 2004. Random walks have proven to be a useful model in understanding processes across a wide spectrum of scientific disciplines. Elements of the Random Walk is an introduction to some of the most powerful and general techniques used in the application of these ideas. The mathematical construct that runs through the
Joseph Rudnick, George Gaspari
openaire   +1 more source

On Nonlinear Correlation of Random Elements

2011
In view of imprecise data in a variety of situations, we proceed to investigate dependence structure of random closed sets. Inspired by the modeling and quantifying of nonlinear dependence structures of random vectors, using copulas, we look at the extension of copula connection to the case of infinitely separable metric spaces with applications to the
openaire   +1 more source

Optimal algorithms for inserting a random element into a random heap

IEEE Transactions on Information Theory, 1997
Summary: Two algorithms for inserting a random element into a random heap are shown to be optimal (in the sense that they use the least number of comparisons on the average among all comparison-based algorithms) for different values of \(n\) under a uniform model.
openaire   +2 more sources

On the concentration phenomenon for -subgaussian random elements

Statistics & Probability Letters, 2006
Let \(X=(X_1,X_2,\dots)\) be a random element with values in \(l^2\) that is scalarly \(\varphi\)-subgaussian. It means that \(E\exp\{tX_k\}\leq \exp\{\varphi(at) \}\) for all \(t\) and \(a\geq\tau_\varphi(X_k)\) with \(\sum \tau_\varphi(X_k)= \tau_\varphi(X)t)\leq 4\exp\{-\varphi^*(Ct/\tau_\varphi(X))\}\), where \(\varphi^*\) is the Young-Fenchel ...
GIULIANO, RITA, TIEN CHUNG HU, A. VOLODIN   +2 more
openaire   +2 more sources

Elements of the randomized combinatorial file structure

Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval - SIGIR '71, 1971
A file structure designed to provide rapid, random access with minimum storage overhead is presented. Storage and retrieval are achieved by direct attribute combination-to-address transformation thereby negating the necessity for large file dictionaries or list-pointer structures.
openaire   +2 more sources

Characteristic Operators and Conditioned Random Elements*

Journal of Mathematical Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Sums of Pettis Integrable Random Elements

Quaestiones Mathematicae, 2002
Abstract unavailable at this time...
openaire   +2 more sources