A. Yu. Veretennikov
University of Leeds
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by A. Yu. Veretennikov.
Stochastic Processes and their Applications | 1997
A. Yu. Veretennikov
Polynomial bounds for the coefficient of [beta]-mixing are established for diffusion processes under weak recurrency assumptions. The method is based on direct evaluations of the moments and certain functionals of hitting-times of the process and on the change of time.
Theory of Probability and Its Applications | 2000
A. Yu. Veretennikov
Polynomial bounds for
Theory of Probability and Its Applications | 2005
S. A. Klokov; A. Yu. Veretennikov
\beta
Archive | 2006
A. Yu. Veretennikov
-mixing and for the rate of convergence to the invariant measure are established for discrete time Markov processes and solutions of stochastic differential equations under weak stability assumptions.
Stochastic Processes and their Applications | 2000
A. Yu. Veretennikov
This paper establishes subexponential bounds for the
Queueing Systems | 2014
A. Yu. Veretennikov
\beta
Theory of Probability and Its Applications | 2013
S. A. Klokov; A. Yu. Veretennikov
-mixing and the rate of convergence to invariant measure for homogeneous Markov processes with continuous and discrete time.
Automation and Remote Control | 2009
A. Yu. Veretennikov
Conditions for existence and uniqueness of invariant measures and weak convergence to these measures for stochastic McKean-Vlasov equations have been established, along with similar approximation results and a new version of existence and uniqueness of strong solutions to these equations.
Theory of Probability and Its Applications | 1999
A. Yu. Veretennikov
A large deviation principle is established for stochastic differential equation systems with slow and fast components and small diffusions in the slow component.
Siberian Advances in Mathematics | 2016
A. Yu. Veretennikov; E. V. Veretennikova
Polynomial convergence rates in total variation are established in Erlang–Sevastyanov type problems with an infinite number of servers and a general distribution of service under assumptions on the intensity of service.