Azam Abdurakhimovich Imomov
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
Research Subjects
Azam Abdurakhimovich Imomov has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Zuhriddin A. Nazarov
Romanovskiy Institute of Mathematics
6 shared publications - Erkin Egamberdievich Tukhtaev
Karshi State University, Uzbekistan
3 shared publications Karshi State University
3 shared publicationsMisliddin Murtazaev
V.I.Romanovskiy Institute of Mathematics, Uzbekistan
3 shared publications- Misliddin S. Murtazaev
V.I.Romanovskiy Institute of Mathematics, Tashkent, Uzbekistan
3 shared publications - Sarvar Iskandarov
Department of Mathematical Analysis, Urgench State University named after Abu Rayhan Biruni, Urgench 220100, Uzbekistan
3 shared publications
Latest Publications
- 4 November 2026
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- p. 1-2
On the Kolmogorov constant explicit form in the theory of discrete-time stochastic branching systems – CORRIGENDUM
The explicit expression for the Kolmogorov constant given in Theorem 1.2 of [1] has a restricted range of validity: it gives the constant precisely for linear-fractional offspring generating functions, whereas for other subcritical offspring generating functions the constant may be strictly larger or strictly smaller than that expression. Within the class of embeddable offspring generating functions the expression is a sharp lower bound for the constant.
- 4 November 2026
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- p. 1-2
On the Kolmogorov constant explicit form in the theory of discrete-time stochastic branching systems – CORRIGENDUM
The explicit expression for the Kolmogorov constant given in Theorem 1.2 of [1] has a restricted range of validity: it gives the constant precisely for linear-fractional offspring generating functions, whereas for other subcritical offspring generating functions the constant may be strictly larger or strictly smaller than that expression. Within the class of embeddable offspring generating functions the expression is a sharp lower bound for the constant.
- Open Access
- 12 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3698
Critical Markov Branching-Immigration Systems: Complete Classification of the State Space and Exact Rates of Convergence
We study a critical homogeneous continuous-time Markov branching-immigration system whose offspring and immigration generating functions regularly vary at point 1 of orders and with . The slowly varying factors are controlled through their index functions, which causes regular variation of the second order, both factors tending to finite positive limits. Two numbers govern the classification: the difference of the two orders and the limit of the ratio of the immigration factor to the offspring one. We classify the state space completely: it is positive recurrent for , transient for , and on the boundary , null recurrent or transient accordingly as or ; at , this is the classical threshold, read under the present second-order hypotheses. In each regime, we identify the limiting generating function of the normalised transition functions, together with the leading term of the deviation from it, uniformly in the argument on compact subsets of , the transient regime under two further inequalities on the parameters. Every rate is carried by a complex-analytic argument and with no monotonicity hypothesis to the individual transition probabilities as an upper bound, which for each fixed state is the exact order when . An exact integral identity for the survival probability of the system without immigration makes the constants explicit and yields a three-term expansion of that probability. A numerical section on explicit models confirms the constants and the rates.- 12 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3698
Open AccessCritical Markov Branching-Immigration Systems: Complete Classification of the State Space and Exact Rates of Convergence
We study a critical homogeneous continuous-time Markov branching-immigration system whose offspring and immigration generating functions regularly vary at point 1 of orders and with . The slowly varying factors are controlled through their index functions, which causes regular variation of the second order, both factors tending to finite positive limits. Two numbers govern the classification: the difference of the two orders and the limit of the ratio of the immigration factor to the offspring one. We classify the state space completely: it is positive recurrent for , transient for , and on the boundary , null recurrent or transient accordingly as or ; at , this is the classical threshold, read under the present second-order hypotheses. In each regime, we identify the limiting generating function of the normalised transition functions, together with the leading term of the deviation from it, uniformly in the argument on compact subsets of , the transient regime under two further inequalities on the parameters. Every rate is carried by a complex-analytic argument and with no monotonicity hypothesis to the individual transition probabilities as an upper bound, which for each fixed state is the exact order when . An exact integral identity for the survival probability of the system without immigration makes the constants explicit and yields a three-term expansion of that probability. A numerical section on explicit models confirms the constants and the rates. - Open Access
- 21 September 2026
- Published by MDPI AG in Preprints.org
Critical Markov Branching-Immigration Systems: Complete Classification of the State Space and Exact Rates of Convergence
We study a critical homogeneous continuous-time Markov branching-immigration system whose offspring and immigration generating functions are regularly varying at the point~1 of orders $1+\nu$ and $\delta$ with $\nu,\delta\in(0,1]$, the slowly varying factors being controlled through their index functions. Two numbers govern the classification: the difference $\gamma=\delta-\nu$ of the two orders and the limit $\Lambda_{\infty}$ of the ratio of the immigration factor to the offspring one. We classify the state space completely: positive recurrent for $\gamma>0$, transient for $\gamma< 0$, and on the boundary $\gamma=0$ null recurrent or transient according as $\Lambda_{\infty}\le{\nu}$ or $\Lambda_{\infty}>\nu$, which at $\nu=\delta=1$ reduces to the classical threshold. In each regime we identify the limiting generating function of the normalised transition functions together with the exact rate of convergence to it, uniformly in the argument on compact subsets of [0,1), the transient rate under two further inequalities on the parameters; and we carry every rate to the individual transition probabilities, with no monotonicity hypothesis, by a complex-analytic argument resting on a factorisation that criticality forces. The constants are made accessible by an exact integral identity for the survival probability of the system without immigration, which also yields a three-term expansion of that probability in closed form. A numerical section on explicit models confirms the constants and the rates.- 21 September 2026
- Published by MDPI AG in Preprints.org
Open AccessCritical Markov Branching-Immigration Systems: Complete Classification of the State Space and Exact Rates of Convergence
We study a critical homogeneous continuous-time Markov branching-immigration system whose offspring and immigration generating functions are regularly varying at the point~1 of orders $1+\nu$ and $\delta$ with $\nu,\delta\in(0,1]$, the slowly varying factors being controlled through their index functions. Two numbers govern the classification: the difference $\gamma=\delta-\nu$ of the two orders and the limit $\Lambda_{\infty}$ of the ratio of the immigration factor to the offspring one. We classify the state space completely: positive recurrent for $\gamma>0$, transient for $\gamma< 0$, and on the boundary $\gamma=0$ null recurrent or transient according as $\Lambda_{\infty}\le{\nu}$ or $\Lambda_{\infty}>\nu$, which at $\nu=\delta=1$ reduces to the classical threshold. In each regime we identify the limiting generating function of the normalised transition functions together with the exact rate of convergence to it, uniformly in the argument on compact subsets of [0,1), the transient rate under two further inequalities on the parameters; and we carry every rate to the individual transition probabilities, with no monotonicity hypothesis, by a complex-analytic argument resting on a factorisation that criticality forces. The constants are made accessible by an exact integral identity for the survival probability of the system without immigration, which also yields a three-term expansion of that probability in closed form. A numerical section on explicit models confirms the constants and the rates. - Open Access
- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
Second--order renewal asymptotics in the finite--variance regularly varying regime
We develop a refined asymptotic theory for renewal processes with regularlyvarying inter-arrival distributions in the finite-variance regime. Assuming that$1-F(t)=t^{-\alpha}L(t)$ with $\alpha\in(2,3)$ and $L$ slowly varying, we establish asecond-order key renewal theorem valid for an arbitrary regularly varying kernel: thedeviation of a renewal convolution from its first-order approximation splits into a localcorrection proportional to the kernel itself, with the Stone constant as factor, and arenewal-driven correction proportional to the equilibrium (stationary-excess) tail, in whichthe kernel enters only through its total mass. Specialisation to the equilibrium kernelyields second-order asymptotic expansions for both the renewal convolution and the renewalfunction, and the same statement settles the second-order behaviour of solutions of renewalequations with regularly varying forcing. The resultsreveal a two-scale structure: the equilibrium tail governs the local renewalcorrection, while its own integrated tail determinesthe global deviation from equilibrium. A particular emphasis is placed on the criticalthreshold $\alpha=2$, where the asymptotic behaviour undergoes a structural transition. Inthis borderline case, the power-law hierarchy collapses and the dominant correction is governedby an integrated slowly varying tail. Nevertheless, the local renewal correction mechanismpersists, and the correction term remains asymptotically proportional to the equilibriumtail. The analysis combines Laplace-transform techniques and Tauberian transfer principleswith an exact decomposition of the renewal correction term through the renewal-densitydefect, which removes the need to invert remainders whose monotonicity is not accessible. The results provide a unified description of second-orderrenewal asymptotics across the entire range $2\leq\alpha<3$, and point to possible extensionsto renewal equations and to age-dependent branching processes.- 8 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSecond--order renewal asymptotics in the finite--variance regularly varying regime
We develop a refined asymptotic theory for renewal processes with regularlyvarying inter-arrival distributions in the finite-variance regime. Assuming that$1-F(t)=t^{-\alpha}L(t)$ with $\alpha\in(2,3)$ and $L$ slowly varying, we establish asecond-order key renewal theorem valid for an arbitrary regularly varying kernel: thedeviation of a renewal convolution from its first-order approximation splits into a localcorrection proportional to the kernel itself, with the Stone constant as factor, and arenewal-driven correction proportional to the equilibrium (stationary-excess) tail, in whichthe kernel enters only through its total mass. Specialisation to the equilibrium kernelyields second-order asymptotic expansions for both the renewal convolution and the renewalfunction, and the same statement settles the second-order behaviour of solutions of renewalequations with regularly varying forcing. The resultsreveal a two-scale structure: the equilibrium tail governs the local renewalcorrection, while its own integrated tail determinesthe global deviation from equilibrium. A particular emphasis is placed on the criticalthreshold $\alpha=2$, where the asymptotic behaviour undergoes a structural transition. Inthis borderline case, the power-law hierarchy collapses and the dominant correction is governedby an integrated slowly varying tail. Nevertheless, the local renewal correction mechanismpersists, and the correction term remains asymptotically proportional to the equilibriumtail. The analysis combines Laplace-transform techniques and Tauberian transfer principleswith an exact decomposition of the renewal correction term through the renewal-densitydefect, which removes the need to invert remainders whose monotonicity is not accessible. The results provide a unified description of second-orderrenewal asymptotics across the entire range $2\leq\alpha<3$, and point to possible extensionsto renewal equations and to age-dependent branching processes. - 10 April 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 208
Advancing limit theorems in Markov branching systems through Karamata slowly varying functions
- 10 April 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 208
Advancing limit theorems in Markov branching systems through Karamata slowly varying functions
- 25 August 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 200
Enhanced asymptotic analysis of continuous-time Markov branching systems: Revisiting limiting structural theorems
- 25 August 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 200
Enhanced asymptotic analysis of continuous-time Markov branching systems: Revisiting limiting structural theorems
- 6 May 2025
- Published by Springer Nature
- p. 158-170
On Application of Karamata Slowly Varying Functions in the Theory of Noncritical Markov Branching Systems
- 6 May 2025
- Published by Springer Nature
- p. 158-170
On Application of Karamata Slowly Varying Functions in the Theory of Noncritical Markov Branching Systems
- Open Access
- 27 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (9) , 1434
Analysis of BMAP/PH/N-Type Queueing System with Flexible Retrials Admission Control
This research examines a multi-server retrial queueing system with a batch Markov arrival process and a phase-type service time distribution. The system’s distinguishing feature is its ability to control the admission of retrial customers. An attempt by a customer to retry is successful only if the number of busy servers does not exceed certain threshold values, which may depend on the state of the fundamental process of the primary customer’s arrival. Impatient retrying customers may abandon the system without obtaining service. A group of primary customers that arrives while the number of available servers is fewer than the group size is either entirely rejected or occupies all available servers, while the remainder of the group transitions to the orbit. The system’s behavior, under a defined set of thresholds, is characterized by a multidimensional Markov chain classified as asymptotically quasi-Toeplitz. This enables the acquisition of the ergodicity condition and the computation of the steady-state distribution of the Markov chain and the system’s performance measures. The presented numerical examples demonstrate the impact of threshold value variation. An example of solving an optimization problem is presented. The importance of the account of the batch arrivals is shown.
- 27 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (9) , 1434
Open AccessAnalysis of BMAP/PH/N-Type Queueing System with Flexible Retrials Admission Control
This research examines a multi-server retrial queueing system with a batch Markov arrival process and a phase-type service time distribution. The system’s distinguishing feature is its ability to control the admission of retrial customers. An attempt by a customer to retry is successful only if the number of busy servers does not exceed certain threshold values, which may depend on the state of the fundamental process of the primary customer’s arrival. Impatient retrying customers may abandon the system without obtaining service. A group of primary customers that arrives while the number of available servers is fewer than the group size is either entirely rejected or occupies all available servers, while the remainder of the group transitions to the orbit. The system’s behavior, under a defined set of thresholds, is characterized by a multidimensional Markov chain classified as asymptotically quasi-Toeplitz. This enables the acquisition of the ergodicity condition and the computation of the steady-state distribution of the Markov chain and the system’s performance measures. The presented numerical examples demonstrate the impact of threshold value variation. An example of solving an optimization problem is presented. The importance of the account of the batch arrivals is shown.