A
Alexander Marynych
Researcher at Taras Shevchenko National University of Kyiv
Publications - 95
Citations - 649
Alexander Marynych is an academic researcher from Taras Shevchenko National University of Kyiv. The author has contributed to research in topics: Random walk & Iterated logarithm. The author has an hindex of 15, co-authored 84 publications receiving 562 citations. Previous affiliations of Alexander Marynych include Eindhoven University of Technology & University of Münster.
Papers
More filters
Journal ArticleDOI
Cones generated by random points on half-spheres and convex hulls of Poisson point processes
TL;DR: In this paper, it was shown that the expected Grassmann angles and conic intrinsic volumes can be expressed through the expected f-vector of the convex hull of the Poisson point process with power-law intensity function.
Posted Content
Limit theorems for the number of occupied boxes in the Bernoulli sieve
TL;DR: In this article, the authors focus on the number of boxes occupied by at least one of the balls in the Bernoulli sieve and derive a variety of limiting distributions from the properties of associated perturbed random walks.
Journal ArticleDOI
Local universality for real roots of random trigonometric polynomials
TL;DR: In this paper, it was shown that the number of real zeros of a random trigonometric polynomial in the interval of a stationary, zero-mean Gaussian process with correlation function is convergent in distribution to the distribution of real zero numbers in an interval of constant size.
Journal ArticleDOI
Limit theorems for renewal shot noise processes with eventually decreasing response functions
TL;DR: In this paper, the authors consider shot noise processes with a deterministic response function h and the shots occurring at renewal epochs 0 = S 0 S 1 S 2 ⋯ of a zero-delayed renewal process and prove convergence of the finite-dimensional distributions of ( X ( u t ) u ≥ 0 as t → ∞ in different regimes.
Journal ArticleDOI
The Bernoulli sieve: an overview
TL;DR: The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or stick-breaking as mentioned in this paper.