Results 31 to 40 of about 6,035,490 (336)
Non-fixation for biased Activated Random Walks [PDF]
We prove that the model of Activated Random Walks on Z^d with biased jump distribution does not fixate for any positive density, if the sleep rate is small enough, as well as for any finite sleep rate, if the density is close enough to 1. The proof uses a new criterion for non-fixation.
Rolla, L., Tournier, L.
openaire +5 more sources
Critical Scaling in Standard Biased Random Walks [PDF]
4 pages, 4 ...
Anteneodo, C., Morgado, W. A. M.
openaire +3 more sources
Testing hypotheses under covariate-adaptive randomisation and additive models
Covariate-adaptive randomisation has a long history of applications in clinical trials. Shao, Yu, and Zhong [(2010). A theory for testing hypotheses under covariate-adaptive randomization. Biometrika, 97, 347–360] and Shao and Yu [(2013).
Ting Ye
doaj +1 more source
On the almost sure convergence of adaptive allocation procedures [PDF]
In this paper, we provide some general convergence results for adaptive designs for treatment comparison, both in the absence and presence of covariates. In particular, we demonstrate the almost sure convergence of the treatment allocation proportion for
Antognini, Alessandro Baldi +1 more
core +2 more sources
Efron's (1971) Biased Coin Design is a well-known randomization technique of sequential clinical trials for comparing two treatments in the absence of prognostic factors that helps neutralize selection bias while keeping the experiment fairly balanced ...
Alessandro Baldi Antognini +2 more
doaj +1 more source
Balancing exploration and exploitation with information and randomization.
Explore-exploit decisions require us to trade off the benefits of exploring unknown options to learn more about them, with exploiting known options, for immediate reward. Such decisions are ubiquitous in nature, but from a computational perspective, they
Robert C. Wilson +3 more
semanticscholar +1 more source
Localization Transition of Biased Random Walks on Random Networks [PDF]
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c.
Sood, Vishal, Grassberger, Peter
openaire +3 more sources
Urban logistics consumes a large portion of energy resources worldwide. Thus, optimization algorithms are used to define mobility modes, vehicle fleets, routing plans, and last-mile delivery operations to reduce energy consumption such as metaheuristics.
Elnaz Ghorbanioskalaei +3 more
doaj +1 more source
Establishing an appropriate disease model that mimics the complexities of human cardiovascular disease is critical for evaluating the clinical efficacy and translation success.
Hye Sook Shin +4 more
doaj +1 more source
Methods for Population Adjustment with Limited Access to Individual Patient Data: A Review and Simulation Study [PDF]
Population-adjusted indirect comparisons estimate treatment effects when access to individual patient data is limited and there are cross-trial differences in effect modifiers.
Baio, Gianluca +2 more
core +2 more sources

