TY  - JOUR
A1  - Blanchard, Gilles
A1  - Delattre, Sylvain
A1  - Roquain, Etienne
T1  - Testing over a continuum of null hypotheses with False Discovery Rate control
JF  - Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability
N2  - We consider statistical hypothesis testing simultaneously over a fairly general, possibly uncountably infinite, set of null hypotheses, under the assumption that a suitable single test (and corresponding p-value) is known for each individual hypothesis. We extend to this setting the notion of false discovery rate (FDR) as a measure of type I error. Our main result studies specific procedures based on the observation of the p-value process. Control of the FDR at a nominal level is ensured either under arbitrary dependence of p-values, or under the assumption that the finite dimensional distributions of the p-value process have positive correlations of a specific type (weak PRDS). Both cases generalize existing results established in the finite setting. Its interest is demonstrated in several non-parametric examples: testing the mean/signal in a Gaussian white noise model, testing the intensity of a Poisson process and testing the c.d.f. of i.i.d. random variables.
KW  - continuous testing
KW  - false discovery rate
KW  - multiple testing
KW  - positive correlation
KW  - step-up
KW  - stochastic process
Y1  - 2014
U6  - https://doi.org/10.3150/12-BEJ488
SN  - 1350-7265
SN  - 1573-9759
VL  - 20
IS  - 1
SP  - 304
EP  - 333
PB  - International Statistical Institute
CY  - Voorburg
ER  - 
TY  - JOUR
A1  - Zaikin, Alexey
A1  - Kurths, Jürgen
T1  - Optimal length transportation hypothesis to model proteasome product size distribution
JF  - Journal of biological physics : emphasizing physical principles in biological research ; an international journal for the formulation and application of mathematical models in the biological sciences
N2  - This paper discusses translocation features of the 20S proteasome in order to explain typical proteasome length distributions. We assume that the protein transport depends significantly on the fragment length with some optimal length which is transported most efficiently. By means of a simple one-channel model, we show that this hypothesis can explain both the one- and the three-peak length distributions found in experiments. A possible mechanism of such translocation is provided by so-called fluctuation-driven transport.
KW  - proteasome
KW  - protein translocation
KW  - stochastic process
KW  - ratchets
Y1  - 2006
U6  - https://doi.org/10.1007/s10867-006-9014-z
SN  - 0092-0606
VL  - 32
IS  - 3-4
SP  - 231
EP  - 243
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Doerr, Benjamin
A1  - Kötzing, Timo
T1  - Multiplicative Up-Drift
JF  - Algorithmica
N2  - Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully employed in the rigorous analysis of evolutionary algorithms, however, only for the situation that the progress is constant or becomes weaker when approaching the target. Motivated by questions like how fast fit individuals take over a population, we analyze random processes exhibiting a (1+delta)-multiplicative growth in expectation. We prove a drift theorem translating this expected progress into a hitting time. This drift theorem gives a simple and insightful proof of the level-based theorem first proposed by Lehre (2011). Our version of this theorem has, for the first time, the best-possible near-linear dependence on 1/delta} (the previous results had an at least near-quadratic dependence), and it only requires a population size near-linear in delta (this was super-quadratic in previous results). These improvements immediately lead to stronger run time guarantees for a number of applications. We also discuss the case of large delta and show stronger results for this setting.
KW  - drift theory
KW  - evolutionary computation
KW  - stochastic process
Y1  - 2020
U6  - https://doi.org/10.1007/s00453-020-00775-7
SN  - 0178-4617
SN  - 1432-0541
VL  - 83
IS  - 10
SP  - 3017
EP  - 3058
PB  - Springer
CY  - New York
ER  -