Growth rate of the state vector in a generalized linear stochastic system with symmetric matrix
N. K. Krivulin

TL;DR
This paper analyzes the mean growth rate of the state vector in a generalized linear stochastic second-order system with a symmetric matrix, where diagonal entries are independent exponential variables.
Contribution
It provides a novel evaluation of the mean growth rate for a specific class of stochastic systems with symmetric matrices and exponential diagonal entries.
Findings
Mean growth rate derived for the system
Analytical expressions obtained under specified assumptions
Insights into the impact of matrix entries on system growth
Abstract
The mean growth rate of the state vector is evaluated for a generalized linear stochastic second-order system with a symmetric matrix. Diagonal entries of the matrix are assumed to be independent and exponentially distributed with different means, while the off-diagonal entries are equal to zero.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Growth Rate of the State Vector in a Generalized Linear Stochastic System with Symmetric Matrix††thanks: Journal of Mathematical Sciences, 2007, Vol. 147, N 4, pp. 6924–6928.
N. K. Krivulin Faculty of Mathematics and Mechanics, St. Petersburg State University, 28 Universitetsky Ave., St. Petersburg, 198504, Russia, [email protected] work was partially supported by the Russian Foundation for Basic Research (grant no. 06-01-00763).
Abstract
The mean growth rate of the state vector is evaluated for a generalized linear stochastic second-order system with a symmetric matrix. Diagonal entries of the matrix are assumed to be independent and exponentially distributed with different means, while the off-diagonal entries are equal to zero.
1 Introduction
The analysis of actual systems in engineering, economics, manufacturing, and other areas often involves generalized linear dynamical models which take the form
[TABLE]
where is a random state transition matrix, is a state vector, and denotes matrix-vector multiplication in some idempotent algebra [1, 2].
In the analysis, one is normally interested in evaluation of the mean (asymptotic) growth rate of the system state vector
[TABLE]
where is an idempotent counterpart to the usual vector norm.
In many cases, it is not difficult to prove existence for the above limit (e.g., with the ergodic theorem presented in [3]). At the same time, evaluation of the limit may appear to be a difficult problem even for quite simple systems. The related results include the solution obtained in [4] for the second-order system with the matrix having all its entries independent and exponentially distributed with unit mean. In [5], another second-order system is examined which has a symmetric matrix such that its diagonal entries are independent and exponentially distributed with unit mean, whereas the off-diagonal entries are equal to zero.
For systems of arbitrary order , there are results known for the case when the entries of the matrix are all independent and identically distributed with either normal [6] or discrete uniform [4] probability distributions. In [7], a general solution is presented for a system with a triangular matrix provided that its random entries have arbitrary distributions with finite mean and variance, and may be dependent.
The purpose of this paper is to evaluate the mean growth rate of the state vector for a second-order system which somewhat generalizes the system with symmetric matrix examined in [5]. In the paper, we assume that the off-diagonal entries of the matrix are still equal to zero, whereas the diagonal entries are independent, and have exponential distributions with parameters and , .
2 Stochastic Linear Dynamical System
Consider a dynamical system such that its evolution is described by the equation
[TABLE]
where
[TABLE]
and symbol stands for matrix-vector multiplication in idempotent algebra [1, 2] with scalar operations and defined respectively as maximum and addition.
Equation (1) can be represented as the system of scalar equations
[TABLE]
or, with ordinary notation, as
[TABLE]
Suppose the sequences and each involve independent and identically distributed random variables, and and are independent for any .
Further assume that and have the exponential probability distribution with respective parameters and . Denote their related distribution functions by
[TABLE]
and their density functions by and .
Note that if , then the system can easily be reduced to that with examined in [5].
Among the performance measures of interest for system (1) is the mean growth rate of system state vector
[TABLE]
where the symbol of norm is taken in an idempotent algebra sense,
[TABLE]
3 Mean Growth Rate of State Vector
By applying the ergodic theorem in [3], it is not difficult to show that if the entries of the matrix are nonnegative and have finite mean values, then limit (2) exists with probability one. Moreover, there also exists the limit
[TABLE]
In order to evaluate the limit, first introduce the random variables
[TABLE]
and note that and .
Consider the distribution functions
[TABLE]
The function can be represented in the form
[TABLE]
which leads to the equation
[TABLE]
Suppose the sequence of functions tends to a distribution function as . (Below we show that this assumption is valid for the system under study.)
Application of Lebesgue’s dominated convergence theorem yields the conclusion that the sequence converges to the distribution function
[TABLE]
of some random variable , and that in distribution.
Moreover, converges to , and consequently,
[TABLE]
4 A Recursive Equation for
With the law of total probability, one can represent as
[TABLE]
Considering that
[TABLE]
we arrive at the recursive equation
[TABLE]
Taking into account exponential distribution of the diagonal entries, we can represent the equation in the form
[TABLE]
Let us consider the function . With the condition , we have
[TABLE]
Now we take (5) to get . First, we evaluate the integral
[TABLE]
Finally, we have
[TABLE]
5 Limiting Distribution Function
Let us verify the convergence of the sequence . Consider the difference
[TABLE]
For all , we have either the inequality when , or when . If , then the functions and coincide.
Assume that . If , then we have
[TABLE]
It is easy to see by induction that for all , the following inequality holds:
[TABLE]
In the same way, we verify that the inequality is also valid if .
Considering that for all , we conclude that the sequence converges to some function as .
Similar reasoning shows that the sequence of the functions also converges when . Clearly, if , then the sequence does not depend on at all.
Substitution of the limiting function into (5) gives the equation
[TABLE]
Taking into account the form of the equation, we find solutions such that
[TABLE]
where are some coefficients.
Let us substitute the above solution into (6). First, we evaluate the integral
[TABLE]
Now we arrive at the system of algebraic equations with respect to and
[TABLE]
which has the solution
[TABLE]
The limiting function takes the form
[TABLE]
It is clear that presents distribution function of some random variable.
6 Evaluation of the Mean Growth Rate
Let us evaluate the mean growth rate on the basis of (4). By applying (3), we get the distribution function
[TABLE]
Its related density function takes the form
[TABLE]
Finally, integrating gives
[TABLE]
Note that if , then we have the result , which is quite consistent with that obtained in [5].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. L. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems . Wiley Series in Probability and Statistics. Wiley, Chichester, 1993. http://www-rocq.inria.fr/metalau/cohen/documents/BCOQ-book.pdf .
- 2[2] V. P. Maslov and V. N. Kolokoltsov, Idempotent Analysis and Its Applications to Optimal Control Theory . Nauka, Moscow, 1994. (in Russian).
- 3[3] J. F. C. Kingman, “Subadditive ergodic theory,” Ann. Probab 1 no. 6, (December, 1973) 883–899 . · doi ↗
- 4[4] G. J. Olsder, J. A. C. Resing, R. De Vries, M. S. Keane, and G. Hooghiemstra, “Discrete event systems with stochastic processing times,” IEEE Transactions on Automatic Control 35 no. 3, (March, 1990) 299–302 . · doi ↗
- 5[5] A. Jean-Marie, “Analytical computation of lyapunov exponents in stochastic event graphs,” in Performance Evaluation of Parallel and Distributed Systems. Solution Methods: Proceedings of the Third QMIPS Workshop. Part 2 , O. J. Boxma and G. M. Koole, eds., vol. 106 of CWI Tracts , pp. 309–341. CWI, Amsterdam, 1994.
- 6[6] J. E. Cohen, “Subadditivity, generalized products of random matrices and operations research,” SIAM Rev. 30 no. 1, (March, 1988) 69–86 . · doi ↗
- 7[7] N. K. Krivulin, “The growth rate of state vector in a generalized linear dynamical system with random triangular matrix,” Vestnik St. Petersburg Univ. Math. 38 no. 1, (March, 2005) 25–28.
