Results 301 to 310 of about 1,461,213 (320)

“To Randomize, or Not to Randomize, That is the Question”

Arthritis & Rheumatology, 2021
Until the end of the last century there were no drugs approved for the treatment of juvenile idiopathic arthritis (JIA). This situation was revolutionized in the past 20 years thanks to 3 factors: the introduction in the USA and in Europe of paediatric legislations(1, 2), the availability of biologic disease-modifying anti-rheumatic drugs (b-DMARDs ...
Nicolino Ruperto, Alberto Martini, Angela Pistorio   +2 more
openaire   +4 more sources

Random Relations, Random Utilities, and Random Functions

Journal of Mathematical Psychology, 2001
The aim of the paper is to extend the first author's earlier results, and to complement and reformulate closely related work, by analyzing the relationship between three fundamental ways of mathematically representing judgements and preferences. The paper significantly extends the following three approaches considered in the paper to modelling the ...
A. A. J. Marley, Michel Regenwetter
openaire   +2 more sources

Random Thoughts on Randomization

JAMA: The Journal of the American Medical Association, 1978
In their informative assessment of 13 years of aortocoronary bypass surgery, DeBakey and Lawrie (p 837), dispute the necessity of prospective randomized studies for the evaluation of surgical diagnostic and therapeutic techniques. They point out that certain time-honored criteria, particularly clinical experience, have proved reliable in assessing ...
openaire   +3 more sources

Are random walks random?

Physica A: Statistical Mechanics and its Applications, 1998
Abstract Random walks have been created using the pseudo-random generators in different computer language compilers (BASIC, PASCAL, FORTRAN, C++) using a Pentium processor. All the obtained paths have apparently a random behavior for short walks (∼214 steps). From long random walks (233 steps) different periods have been found, the shortest being 218
Josep Nogués, K.V. Rao, J.L. Costa-Krämer   +2 more
openaire   +2 more sources

“Random” random matrix products [PDF]

Journal d'Analyse Mathématique, 2001
This 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

Randomization of random variables and their distributions

Cybernetics, 1987
A family \(\Phi\) of distribution functions is called finitely randomizable if there exists a finite collection of distribution functions \((F_ i\), \(i=1,...,n)\) such that each member of \(\Phi\) is a convex linear combination of \((F_ i\), \(i=1,....,n)\).
L. N. Gurvits, A. M. Zakharin
openaire   +2 more sources

Random trees and random graphs

Random Structures and Algorithms, 1998
Summary: 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

Randomness is hard

Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 2000
Summary: We study the set of incompressible strings for various resource bounded versions of Kolmogorov complexity. The resource bounded versions of Kolmogorov complexity we study are polynomial time CD complexity defined by Sipser, the nondeterministic variant CND due to Buhrman and Fortnow, and the polynomial space bounded Kolmogorov complexity CS ...
Buhrman, H.M., Torenvliet, L.
openaire   +6 more sources

Random fields on random graphs

Advances in Applied Probability, 1992
The distribution (1) used previously by the author to represent polymerisation of several types of unit also prescribes quite general statistics for a random field on a random graph. One has the integral expression (3) for its partition function, but the multiple complex form of the integral makes the nature of the expected saddlepoint evaluation in ...
openaire   +3 more sources

Random walk in random groups

Geometric and Functional Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources