Results 11 to 20 of about 62,622 (269)

Randomized graph cluster randomization

open access: yesJournal of Causal Inference, 2023
Abstract The global average treatment effect (GATE) is a primary quantity of interest in the study of causal inference under network interference. With a correctly specified exposure model of the interference, the Horvitz–Thompson (HT) and Hájek estimators of the GATE are unbiased and consistent, respectively, yet
Ugander Johan, Yin Hao
openaire   +3 more sources

Randomness? What Randomness? [PDF]

open access: yesFoundations of Physics, 2020
AbstractThis is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and compressibility. Following a (Wittgensteinian) philosophical discussion of randomness in general, I argue that deterministic interpretations of
openaire   +5 more sources

Random Trees in Random Graphs [PDF]

open access: yesProceedings of the American Mathematical Society, 1988
We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire   +2 more sources

A Method to Determine the Most Suitable Initial Conditions of Chaotic Map in Statistical Randomness Applications

open access: yesIEEE Access, 2021
The processes and systems in the real world actually contain order and symmetry. Understanding these order and symmetrical behavior has been a common effort of scientists.
Mehmet Sahin Acikkapi, Fatih Ozkaynak
doaj   +1 more source

Randomized Quasi-Random Testing [PDF]

open access: yesIEEE Transactions on Computers, 2016
Random testing is a fundamental testing technique that can be used to generate test cases for both hardware and software systems. Quasi-random testing was proposed as an enhancement to the cost-effectiveness of random testing: In addition to having similar computation overheads to random testing, it makes use of quasi-random sequences to generate low ...
Huai Liu, Tsong Yueh Chen
openaire   +2 more sources

Axonal Stimulations With a Higher Frequency Generate More Randomness in Neuronal Firing Rather Than Increase Firing Rates in Rat Hippocampus

open access: yesFrontiers in Neuroscience, 2018
Deep brain stimulation (DBS) has been used for treating many brain disorders. Clinical applications of DBS commonly require high-frequency stimulations (HFS, ∼100 Hz) of electrical pulses to obtain therapeutic efficacy.
Zhaoxiang Wang   +2 more
doaj   +1 more source

A random shock is not random assignment [PDF]

open access: yesEconomics Letters, 2016
A random shock excludes reverse causality and reduces omitted variable bias. Yet a natural experiment does not identify random exposure to treatment, but the reaction to a random change from baseline to treatment. A lab experiment comparing higher certainty with higher severity of punishment for stealing (holding the expected value of the intervention ...
openaire   +4 more sources

Random fields and random sampling [PDF]

open access: yesKybernetika, 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

The randomized communication complexity of randomized auctions [PDF]

open access: yesProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
We study the communication complexity of incentive compatible auction-protocols between a monopolist seller and a single buyer with a combinatorial valuation function over $n$ items. Motivated by the fact that revenue-optimal auctions are randomized [Tha04,MV10,BCKW10,Pav11,HR15] (as well as by an open problem of Babaioff, Gonczarowski, and Nisan ...
Aviad Rubinstein, Junyao Zhao 0001
openaire   +2 more sources

Random walks on the random graph [PDF]

open access: yesThe Annals of Probability, 2018
We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël   +3 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy