Editorial

This is the special issue of the journal "Modern Stochastics: Theory and Applications", for which the papers on the occasion of Professor Dmitrii Silvestrov's 70th birthday are collected.Dmitrii Silvestrov is a prominent mathematician, who started his scientific research activity at Kyiv probabilistic school and became famous and world-wide recognized for his achievements in the theory of stochastic processes, actuarial and financial mathematics, mathematical modeling of stochastic systems.Maintaining over years strong links with Ukrainian mathematicians, he has also developed scientific cooperation with scientists in many countries.Dmitrii Silvestrov began his scientific and teaching career at the Mechanics and Mathematics Faculty of Taras Shevchenko National University of Kyiv.He defended his Candidate of Science (Ph.D.) dissertation devoted to limit theorems for semi-Markov processes in 1969, and in 1973 he received the Doctor of Science degree, having developed in his doctoral dissertation an advanced theory of limit theorems for randomly stopped processes, which gives effective general conditions for weak convergence and convergence in topologies U and J for compositions of càdlàg processes.Later, D. Silvestrov presented the extended variant of the theory of limit theorems for randomly stopped stochastic processes in his book Limit Theorems for Randomly Stopped Stochastic Processes, Springer, London (2004).In 1974, D. Silvestrov took up a Professor position at the Department of Theory of Probability and Mathematical Statistics at Kyiv University.At that time, his research interests focused on the renewal theory and ergodic theorems for perturbed stochastic processes; he obtained the results concerned with a generalization of the classical renewal theorem to the model of perturbed renewal equations and the exact coupling and ergodic theorems for perturbed regenerative and semi-Markov type processes.In 1980s, D.Silvestrov's studies were also related to applied statistics and development of statistical software.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.