Related papers: Correction. Central limit theorems for additive fu…
We survey recent work on normal functions, including limits and singularities of admissible normal functions, the Griffiths-Green approach to the Hodge conjecture, algebraicity of the zero-locus of a normal function, Neron models, and…
This paper re-examines the limit theorems of Abadie and Imbens for nearest-neighbor matching estimators of average treatment effects with a fixed number of matches. We establish, for the first time, a non-normalized central limit theorem…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
Based on deleting-item central limit theory, the classical Donsker's theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete…
Rejoinder to ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
An error in the paper [J. Math. Phys. 43, 6343 (2002); math-ph/0207009] is corrected. Further explanation is given.
In this paper we show that the lengths of the approximating processes in epsilon substitution method are calculable by ordinal recursions in an optimal way.
We expand the theoretical background of the recently introduced superadditive and subadditive transformations of aggregation functions $A$. Necessary and sufficient conditions ensuring that a transformation of a proper aggregation function…
We prove functional limit theorems for dynamical systems in the presence of clusters of large values which, when summed and suitably normalised, get collapsed in a jump of the limiting process observed at the same time point. To keep track…
In this paper, a very useful lemma (in two versions) is proved: it simplifies notably the essential step to establish a Lindeberg central limit theorem for dependent processes. Then, applying this lemma to weakly dependent processes…
Reliability of safety-critical systems is an important issue in system engineering and in most practical situations the reliability of a non series-parallel network system has to be calculated. Some methods for calculating reliability use…
In this paper, we present some multi-dimensional central limit theorems and laws of large numbers under sublinear expectations, which extend some previous results.
This addendum presents a relevant stronger consequence of the main theorem of the paper "Higher order stroboscopic averaged functions: a general relationship with Melnikov functions" [arXiv:2011.03663], EJQTDE No. 77 (2021).
This is a supplement to the article "Markov Chain Monte Carlo Based on Deterministic Transformations" available at http://arxiv.org/abs/1106.5850
This is an appendix to our paper "An update of the Hirsch Conjecture" (arXiv:0907.1186), containing proofs of some of the results and comments that were omitted in it.
In this paper we study the almost sure conditional central limit theorem in its functional form for a class of random variables satisfying a projective criterion. Applications to strongly mixing processes and non irreducible Markov chains…
Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…
Corrections are brought to an article of Friesen on continued fractions of a given period.