Serguei Pergamenchtchikov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Serguei Pergamenchtchikov has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Evgenij Anatol'Ievich Pchelintsev
Tomsk State University
11 shared publications - Leonid Galtchouk
Louis Pasteur University of Strasbourg University of Rouen
7 shared publications - Victor Konev
Tomsk State University
5 shared publications - Huu Thai4 shared publications
- Slim Beltaief
ALTEN de Toulouse, Toulouse, France
4 shared publications - Vlad Stefan Barbu
Laboratory of Mathematics Raphaël Salem (LMRS) UMR CNRS 6085 University of Rouen Normandy France
4 shared publications
Latest Publications
- 26 August 2026
- Published by Taylor & Francis in Sequential Analysis
- p. 1-32
Optimal sequential change-point detection for Markov models under probability criteria over short time intervals
- 26 August 2026
- Published by Taylor & Francis in Sequential Analysis
- p. 1-32
Optimal sequential change-point detection for Markov models under probability criteria over short time intervals
- Open Access
- 21 July 2026
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- p. 1-27
Asymptotic ruin probability for Sparre–Andersen models with investments in financial markets driven by hidden Markov chains
This paper considers ruin problems for insurance companies investing their reserves in stochastic volatility financial markets driven by hidden Markov chains in the framework of Sparre–Andersen insurance models. Since for such models the corresponding renewal equation has dependent coefficients and, as a consequence, the crucial conditions of the Goldie theorem are not satisfied, we develop here a drastically different approach to solve the problem, based on the renewal method proposed by Klüppelberg and Pergamenchtchikov (2004) for general Markov models. On the basis of this result, the asymptotic form for the ruin probability is obtained. More precisely, we find sufficient conditions under which it is shown that the ruin probability decays to zero with the power rate as the initial capital goes to infinity. Next, we construct financial strategies for which this convergence rate can be calculated explicitly; it has been established that this rate can be made more rapid than any power rate. Finally, Monte Carlo simulations which confirm the obtained theoretical results are given.
- 21 July 2026
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- p. 1-27
Open AccessAsymptotic ruin probability for Sparre–Andersen models with investments in financial markets driven by hidden Markov chains
This paper considers ruin problems for insurance companies investing their reserves in stochastic volatility financial markets driven by hidden Markov chains in the framework of Sparre–Andersen insurance models. Since for such models the corresponding renewal equation has dependent coefficients and, as a consequence, the crucial conditions of the Goldie theorem are not satisfied, we develop here a drastically different approach to solve the problem, based on the renewal method proposed by Klüppelberg and Pergamenchtchikov (2004) for general Markov models. On the basis of this result, the asymptotic form for the ruin probability is obtained. More precisely, we find sufficient conditions under which it is shown that the ruin probability decays to zero with the power rate as the initial capital goes to infinity. Next, we construct financial strategies for which this convergence rate can be calculated explicitly; it has been established that this rate can be made more rapid than any power rate. Finally, Monte Carlo simulations which confirm the obtained theoretical results are given.
- 5 November 2024
- Published by Springer Nature
- p. 77-88
Quickest Detection of Failures in Autoregressive Stochastic Systems in Short Periods
- 5 November 2024
- Published by Springer Nature
- p. 77-88
Quickest Detection of Failures in Autoregressive Stochastic Systems in Short Periods
- 10 November 2023
- Published by Springer Nature in Finance and Stochastics
- Vol. 28 (1) , 1-37
Optimal investment and consumption for financial markets with jumps under transaction costs
- 10 November 2023
- Published by Springer Nature in Finance and Stochastics
- Vol. 28 (1) , 1-37
Optimal investment and consumption for financial markets with jumps under transaction costs
- 23 August 2023
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 530 (2)
Stochastic control methods for optimization problems in Ornstein-Uhlenbeck spread models
- 23 August 2023
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 530 (2)
Stochastic control methods for optimization problems in Ornstein-Uhlenbeck spread models
- Open Access
Statistical Analysis of Time Series and Forecasting
In this course, we present the principal parts of the time series analysis. First, stationary processes and trends in times series are introduced. Then we consider the linear regression models for which we study the main problems such that point estimation, the construction of confidence intervals, hypothesis testing, and forecasting. In addition, big data models and the main methods for their analysis are presented. Finally, we introduce the autoregressive and moving average autoregressive processes (ARMA) and study their basic properties, including the problem of forecasting.
Open AccessStatistical Analysis of Time Series and Forecasting
In this course, we present the principal parts of the time series analysis. First, stationary processes and trends in times series are introduced. Then we consider the linear regression models for which we study the main problems such that point estimation, the construction of confidence intervals, hypothesis testing, and forecasting. In addition, big data models and the main methods for their analysis are presented. Finally, we introduce the autoregressive and moving average autoregressive processes (ARMA) and study their basic properties, including the problem of forecasting.
- Open Access
Optimal guaranteed estimation methods for the Cox - Ingersoll - Ross models
In this paper we study parameter estimation problems for the Cox-Ingersoll-Ross (CIR) processes. For the first time for such models sequential estimation procedures are proposed. In the non-asymptotic setting, the proposed sequential procedures provide the estimation with non-asymptotic fixed mean square accuracy. For the scalar parameter estimation problems non-asymptotic normality properties for the proposed estimators are established even in the cases when the classical non sequential maximum likelihood estimators can not be calculated. Moreover, the Laplace transformations for the mean observation durations are obtained. In the asymptotic setting, the limit forms for the mean observation durations are founded and it is shown, that the constructed sequential estimators uniformly converge in distribution to normal random variables. Then using the Local Asymptotic Normality (LAN) property it is obtained asymptotic sharp lower bound for the minimax risks in the class of all sequential procedures with the same mean observation duration and as consequence, it is established, that the proposed sequential procedures are optimal in the minimax sens in this class.
Open AccessOptimal guaranteed estimation methods for the Cox - Ingersoll - Ross models
In this paper we study parameter estimation problems for the Cox-Ingersoll-Ross (CIR) processes. For the first time for such models sequential estimation procedures are proposed. In the non-asymptotic setting, the proposed sequential procedures provide the estimation with non-asymptotic fixed mean square accuracy. For the scalar parameter estimation problems non-asymptotic normality properties for the proposed estimators are established even in the cases when the classical non sequential maximum likelihood estimators can not be calculated. Moreover, the Laplace transformations for the mean observation durations are obtained. In the asymptotic setting, the limit forms for the mean observation durations are founded and it is shown, that the constructed sequential estimators uniformly converge in distribution to normal random variables. Then using the Local Asymptotic Normality (LAN) property it is obtained asymptotic sharp lower bound for the minimax risks in the class of all sequential procedures with the same mean observation duration and as consequence, it is established, that the proposed sequential procedures are optimal in the minimax sens in this class.
- 1 January 2023
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Matematika i Mekhanika
- No. 85,p. 22-31
Super-efficient robust estimation in Lévy continuous time regression models from discrete data
In this paper we consider the nonparametric estimation problem for a continuous time regression model with non-Gaussian Levy noise of small intensity. The estimation problem is studied under the condition that the observations are accessible only at discrete time moments. In this paper, based on the nonparametric estimation method, a new estimation procedure is constructed, for which it is shown that the rate of convergence, up to a certain logarithmic coefficient, is equal to the parametric one, i.e., super-efficient property is provided. Moreover, in this case, the Pinsker constant for the Sobolev ellipse with the geometrically increasing coefficients is calculated, which turns out to be the same as for the case of complete observations.
- 1 January 2023
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Matematika i Mekhanika
- No. 85,p. 22-31
Super-efficient robust estimation in Lévy continuous time regression models from discrete data
In this paper we consider the nonparametric estimation problem for a continuous time regression model with non-Gaussian Levy noise of small intensity. The estimation problem is studied under the condition that the observations are accessible only at discrete time moments. In this paper, based on the nonparametric estimation method, a new estimation procedure is constructed, for which it is shown that the rate of convergence, up to a certain logarithmic coefficient, is equal to the parametric one, i.e., super-efficient property is provided. Moreover, in this case, the Pinsker constant for the Sobolev ellipse with the geometrically increasing coefficients is calculated, which turns out to be the same as for the case of complete observations.
- Open Access
Adaptive efficient robust sequential analysis for autoregressive big data models
In this paper we consider high dimension models based on dependent observations defined through autoregressive processes. For such models we develop an adaptive efficient estimation method via the robust sequential model selection procedures. To this end, we first obtain a van Trees inequality for such models, and then, using this inequality, we probably for the first time obtain a sharp lower bound for the weighted robust risk in an explicit form given by the famous Pinsker constant. Moreover, in getting this lower bound we have found the nonparametric version of the Fisher information for this model. Then, using the weighted least square method and sharp non asymptotic oracle inequalities from (Arkoun O., Brua J.-Y., and Pergamenchtchikov S. 2019. Sequential Analysis 38(4): 437-460), we develop analytic tools to provide the efficiency property in the minimax sense for the proposed estimation procedure, i.e. we show that the upper bound for its risk coincides with the obtained lower bound. It should be emphasized that this property is obtained without using sparse conditions and in the adaptive setting when the parameter dimension and model regularity are unknown. We then study the constructed procedures numerically using Monte Carlo simulations.
Open AccessAdaptive efficient robust sequential analysis for autoregressive big data models
In this paper we consider high dimension models based on dependent observations defined through autoregressive processes. For such models we develop an adaptive efficient estimation method via the robust sequential model selection procedures. To this end, we first obtain a van Trees inequality for such models, and then, using this inequality, we probably for the first time obtain a sharp lower bound for the weighted robust risk in an explicit form given by the famous Pinsker constant. Moreover, in getting this lower bound we have found the nonparametric version of the Fisher information for this model. Then, using the weighted least square method and sharp non asymptotic oracle inequalities from (Arkoun O., Brua J.-Y., and Pergamenchtchikov S. 2019. Sequential Analysis 38(4): 437-460), we develop analytic tools to provide the efficiency property in the minimax sense for the proposed estimation procedure, i.e. we show that the upper bound for its risk coincides with the obtained lower bound. It should be emphasized that this property is obtained without using sparse conditions and in the adaptive setting when the parameter dimension and model regularity are unknown. We then study the constructed procedures numerically using Monte Carlo simulations.
- 5 September 2022
- Published by Springer Nature in Finance and Stochastics
- Vol. 26 (4) , 877-897
On ruin probabilities with investments in a risky asset with a regime-switching price
- 5 September 2022
- Published by Springer Nature in Finance and Stochastics
- Vol. 26 (4) , 877-897
On ruin probabilities with investments in a risky asset with a regime-switching price