Results 251 to 260 of about 5,148,982 (304)
, 2002 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Random Averaging of Vector Elements
SIAM Journal on Applied Mathematics, 1984Given vector ${\bf x} = (x_1 , \cdots ,x_N )$, select $\lambda \in (0,1)$ according to measure $\mu $ and a pair $(x_i ,x_j )$ according to measure $\nu $ giving all pairs positive probability. Replace $x_i $ by $\lambda x_i + (1 - \lambda )x_j $ and $x_j $ by $(1 - \lambda )x_i + \lambda x_j $.
Proschan, Frank, Shaked, Moshe
openaire +2 more sources
On Finite-Dimensional Distributions of a Random Element Conditioned by the Sum of Random Elements*
Journal of Mathematical Sciences, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Application of a Gaussian Random Operator to Random Elements
Theory of Probability & Its Applications, 1987See the review in Zbl 0618.60048.
openaire +2 more sources
A Markov Evolving Random Field and Spliting Random Elements
Theory of Probability & Its Applications, 1993See the review in Zbl 0766.60057.
Greenwood, P. E., Evstigneev, I. V.
openaire +2 more sources
Convergence of random elements
2000There 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, 2005AbstractAlgorithms 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
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
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