Results 281 to 290 of about 521,586 (313)
Some of the next articles are maybe not open access.
Randomization Among: The Other Randomization
Ethics & Human Research, 2019ABSTRACTA valid informed consent process for a randomized controlled trial requires the disclosure to potential participants that they will be randomized to receive the study intervention or a control intervention. This is a case of randomizationwithina trial, a type of randomization that has received significant attention in research ethics.
openaire +2 more sources
Random trees and random graphs
Random Structures and Algorithms, 1998Summary: We study the asymptotic behavior of the number of trees with \(n\) vertices and diameter \(k= k(n)\), where \((n- k)/n\to a\) as \(n\to\infty\) for some constant \(a< 1\). We use this result to determine the limit distribution of the diameter of the random graph \(G(n,p)\) in the subcritical phase.
openaire +3 more sources
Geometric and Functional Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Multiclass Classification: Generalizing Random Forests to Random MNL and Random NB [PDF]
, 2007 Random Forests (RF) is a successful classifier exhibiting performance comparable to Adaboost, but is more robust. The exploitation of two sources of randomness, random inputs (bagging) and random features, make RF accurate classifiers in several domains.
Anita Prinzie, Dirk Van den Poel
openaire +1 more source
“Random” random matrix products
Journal d'Analyse Mathématique, 2001This paper studies compositions of independent random bundle maps \(F(x,a)=f_Fx,T_F(x)a\), \(x\in X\), \(a\in \mathbb R^d\), where \(X\) is a Borel subset of a Polish space, whose distributions form a stationary process. This specializes to the case of products of independent random matrices evolving by a stationary process and generalizes many results
openaire +2 more sources
Local Randomness in Polynomial Random Number and Random Function Generators
SIAM Journal on Computing, 1993A distribution on n-bit strings is called $(\varepsilon ,e)$-locally random, if for every choice of $e \leqslant n$ positions the induced distribution on e-bit strings is in the $L_1 $-norm at most $\varepsilon $ away from the uniform distribution on e-bit strings. Local randomness in polynomial random number generators (RNG) that are candidate one-way
Harald Niederreiter, Claus-Peter Schnorr
openaire +2 more sources
Random Walks And Random Environments
1995Abstract This is the first volume of a two-volume work devoted to probability theory in physics, physical chemistry and engineering. This volume provides an introduction to the problem of "random walk" and its applications. In its simplest form, the random walk describes the motion of an idealized drunkard and is a discrete analogue ...
openaire +1 more source
On Degrees of Randomness and Genetic Randomness
2012This essay is inspired by Cristian Calude's view on degrees of randomness, in relation with "algorithmic randomness". As a "probability person", I am interested in "probabilistic randomness", which can be considered, within the omnipresent uncertainty, only in relation with a real phenomenon/source.
openaire +1 more source