Valeriy Naumov
Research Subjects
Valeriy Naumov has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Konstantin Samouylov
Department of Probability Theory and Cybersecurity, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia
21 shared publications - Yuliya Gaidamaka
Department of Probability Theory and Cybersecurity, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia
10 shared publications - Natalia Yarkina
Faculty of Information Technology and Communication Sciences, Tampere University, Tampere, Finland
7 shared publications Konstantin Samouylov
Peoples’ Friendship University of Russia (RUDN University)
6 shared publicationsNatalia Yarkina
Peoples’ Friendship University of Russia (RUDN University)
6 shared publicationsYuliya Gaidamaka
Peoples’ Friendship University of Russia (RUDN University)
6 shared publications
Latest Publications
- Open Access
- 8 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1223
Computing the Matrix G of Multi-Dimensional Markov Chains of M/G/1 Type
We consider Md-M/G/1 processes, which are irreducible discrete-time Markov chains consisting of two components. The first component is a nonnegative integer vector, while the second component indicates the state (or phase) of the external environment. The level of a state is defined by the minimum value in its first component. The matrix G of the process represents the conditional probabilities that, starting from a given state of a certain level, the Markov chain will first reach a lower level in a specific state. This study aims to develop an effective algorithm for computing matrices for Md-M/G/1 processes.- 8 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1223
Open AccessComputing the Matrix G of Multi-Dimensional Markov Chains of M/G/1 Type
We consider Md-M/G/1 processes, which are irreducible discrete-time Markov chains consisting of two components. The first component is a nonnegative integer vector, while the second component indicates the state (or phase) of the external environment. The level of a state is defined by the minimum value in its first component. The matrix G of the process represents the conditional probabilities that, starting from a given state of a certain level, the Markov chain will first reach a lower level in a specific state. This study aims to develop an effective algorithm for computing matrices for Md-M/G/1 processes. - Open Access
- 9 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (2) , 209
Multi-Dimensional Markov Chains of M/G/1 Type
We consider an irreducible discrete-time Markov process with states represented as (k, i) where k is an M-dimensional vector with non-negative integer entries, and i indicates the state (phase) of the external environment. The number n of phases may be either finite or infinite. One-step transitions of the process from a state (k, i) are limited to states (n, j) such that n ≥ k−1, where 1 represents the vector of all 1s. We assume that for a vector k ≥ 1, the one-step transition probability from a state (k, i) to a state (n, j) may depend on i, j, and n − k, but not on the specific values of k and n. This process can be classified as a Markov chain of M/G/1 type, where the minimum entry of the vector n defines the level of a state (n, j). It is shown that the first passage distribution matrix of such a process, also known as the matrix G, can be expressed through a family of nonnegative square matrices of order n, which is a solution to a system of nonlinear matrix equations.
- 9 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (2) , 209
Open AccessMulti-Dimensional Markov Chains of M/G/1 Type
We consider an irreducible discrete-time Markov process with states represented as (k, i) where k is an M-dimensional vector with non-negative integer entries, and i indicates the state (phase) of the external environment. The number n of phases may be either finite or infinite. One-step transitions of the process from a state (k, i) are limited to states (n, j) such that n ≥ k−1, where 1 represents the vector of all 1s. We assume that for a vector k ≥ 1, the one-step transition probability from a state (k, i) to a state (n, j) may depend on i, j, and n − k, but not on the specific values of k and n. This process can be classified as a Markov chain of M/G/1 type, where the minimum entry of the vector n defines the level of a state (n, j). It is shown that the first passage distribution matrix of such a process, also known as the matrix G, can be expressed through a family of nonnegative square matrices of order n, which is a solution to a system of nonlinear matrix equations.
- Open Access
- 30 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 444
A Matrix-Multiplicative Solution for Multi-Dimensional QBD Processes
We consider an irreducible positive-recurrent discrete-time Markov process on the state space , where is the set of non-negative integers and . The number of states in may be either finite or infinite. We assume that the process is a homogeneous quasi-birth-and-death process (QBD). It means that the one-step transition probability between non-boundary states and may depend on , and but not on the specific values of and . It is shown that the stationary probability vector of the process is expressed through square matrices of order , which are the minimal non-negative solutions to nonlinear matrix equations.- 30 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 444
Open AccessA Matrix-Multiplicative Solution for Multi-Dimensional QBD Processes
We consider an irreducible positive-recurrent discrete-time Markov process on the state space , where is the set of non-negative integers and . The number of states in may be either finite or infinite. We assume that the process is a homogeneous quasi-birth-and-death process (QBD). It means that the one-step transition probability between non-boundary states and may depend on , and but not on the specific values of and . It is shown that the stationary probability vector of the process is expressed through square matrices of order , which are the minimal non-negative solutions to nonlinear matrix equations. - Open Access
- 22 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2685
Resource System with Losses in a Random Environment
The article deals with queueing systems with random resource requirements modeled as bivariate Markov jump processes. One of the process components describes the service system with limited resources. Another component represents a random environment that submits multi-class requests for resources to the service system. If the resource request is lost, then the state of the service system does not change. The change in the state of the environment interacting with the service system depends on whether the resource request has been lost. Thus, unlike in known models, the service system provides feedback to the environment in response to resource requests. By analyzing the properties of the system of integral equations for the stationary distribution of the corresponding random process, we obtain the conditions for the stationary distribution to have a product form. These conditions are expressed in the form of three systems of nonlinear equations. Several special cases are explained in detail.
- 22 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2685
Open AccessResource System with Losses in a Random Environment
The article deals with queueing systems with random resource requirements modeled as bivariate Markov jump processes. One of the process components describes the service system with limited resources. Another component represents a random environment that submits multi-class requests for resources to the service system. If the resource request is lost, then the state of the service system does not change. The change in the state of the environment interacting with the service system depends on whether the resource request has been lost. Thus, unlike in known models, the service system provides feedback to the environment in response to resource requests. By analyzing the properties of the system of integral equations for the stationary distribution of the corresponding random process, we obtain the conditions for the stationary distribution to have a product form. These conditions are expressed in the form of three systems of nonlinear equations. Several special cases are explained in detail.
- 1 January 2021
- Published by Springer Nature
- p. 87-104
Modeling Arrival and Service Processes
- 1 January 2021
- Published by Springer Nature
- p. 267-288
Application Examples and Case Studies
- 1 January 2021
- Published by Springer Nature
- p. 3-23
Modeling and Performance Analysis of Telecommunication Systems
- 1 January 2021
- Published by Springer Nature
- p. 3-23
Modeling and Performance Analysis of Telecommunication Systems
- 1 January 2021
- Published by Springer Nature
- p. 107-134
Generator Matrices
- 1 January 2021
- Published by Springer Nature
- p. 227-249
Markovian Systems with Random Resource Requirements
- 1 January 2021
- Published by Springer Nature
- p. 227-249
Markovian Systems with Random Resource Requirements