Results 1 to 10 of about 707,184 (259)
Representative Samples, Random Sampling
Cambio. Rivista sulle Trasformazioni Sociali, 2022 Abstract della redazione: In the social sciences literature the expressions ‘random sample’ and ‘representative sample’ are often used improperly and sometimes even interchangeably by students who seem to think that sample is representative in so far, and because, it is random. In this essay I shall discuss the proper use of ‘random ...
Alberto Marradi
openaire +3 more sources
Random fields and random sampling [PDF]
Kybernetika, 2020 The authors study the limit in distribution of the maximum of a stationary bivariate real random field, sampled at double random times under some dependence conditions. It is shown that the limit distribution is a max-semistable distribution when the random samples have a geometric growth pattern. When the random field is sampled at double random times,
Sandra Dias, Maria da Graça Temido
openaire +1 more source
Discrete & Computational Geometry, 2020 We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such algorithms typically involve a step of finding the optimal solution for a random sample of the constraints.
Kenneth L. Clarkson +3 more
openaire +6 more sources
Pruned Discrete Random Samples [PDF]
Journal of Applied Probability, 2013 Let Xi,i ∈ ℕ, be independent and identically distributed random variables with values in ℕ0. We transform (‘prune’) the sequence {X1,…,Xn},n∈ ℕ, of discrete random samples into a sequence {0,1,2,…,Yn}, n∈ ℕ, of contiguous random sets by replacing Xn+1 with Yn +1 if Xn+1 >Yn. We consider the asymptotic behaviour of Yn as n→∞.
Grübel, Rudolf, Hitczenko, Paweł
openaire +4 more sources
Random sampling with a reservoir [PDF]
ACM Transactions on Mathematical Software, 1985 We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown beforehand. The main result of the paper is the design and analysis of Algorithm Z; it does the sampling in one pass ...
openaire +2 more sources
Sampling Random Transfer Functions [PDF]
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2004 Recently, considerable attention has been paid to the use of probabilistic algorithms for analysis and design of robust control systems. However, since these algorithms require the generation of random samples of the uncertain parameters, their application has been mostly limited to the case of parametric uncertainty.
Constantino M. Lagoa +3 more
openaire +1 more source
Random Sampling of Plane Partitions [PDF]
Combinatorics, Probability and Computing, 2009 This article presents uniform random generators of plane partitions according to size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity isO(n(lnn)3) in approximate-size sampling andO(n4/3) in exact-size sampling ...
Bodini, Olivier +2 more
openaire +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background 131I‐metaiodobenzylguanidine (131I‐MIBG) radiotherapy is a key treatment for relapsed and refractory (R/R) neuroblastoma (NB). Patients with R/R disease treated in the modern era are increasingly exposed to anti‐GD2 immunotherapy, which exerts selective pressure and may modify both tumor cell state and microenvironment.
Benjamin J. Lerman +7 more
wiley +1 more source
Sampling Random Colorings of Sparse Random Graphs [PDF]
, 2018 We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sampling $k$-colorings of a sparse random graph $G(n,d/n)$ for constant $d$. The best known rapid mixing results for general graphs are in terms of the maximum degree $Δ$ of the input graph $G$ and hold when $k>11Δ/6$ for all $G$.
Charilaos Efthymiou 0001 +3 more
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Wilms tumor (WT) treatment imposes a significant time burden on patients and their families. Time toxicity is a patient‐centered metric that quantifies the burden of healthcare interaction. We sought to define time toxicity in the first year after diagnosis of WT and hypothesized that it would increase as tumor stage and treatment ...
Caleb Q. Ashbrook +6 more
wiley +1 more source