ON THE SPECTRAL RADIUS OF MATRICES FROM PROBABILITY GENERATING FUNCTION METHOD

Morteza Ebneshahrashoob (U.S.A.) and Tangan Gao (U.S.A.)

Received September 4, 2009

References:

[1] B. Chaderjian, B. M. Ebneshahrashoob and T. Gao, A numerical algorithm for distributions of soonest waiting time problems in Markov dependent trials, Adv. & Appl. in Statist. 13 (2009), 95-109. [2] M. Ebneshahrashoob, T. Gao and M. Sobel, Double window acceptance sampling, Naval Res. Logist. 51 (2004), 297-306. [3] M. Ebneshahrashoob, T. Gao and M. Sobel, Random accessibility as a parallelism to reliability studies on simple graphs, Comm. Statist. Theory Methods 34 (2005), 1423-1436. [4] M. Ebneshahrashoob, T. Gao and M. Wu, An efficient algorithm for exact distribution of discrete scan statistics, Methodol. Comput. Appl. Probab. 7 (2005), 459-471. [5] W. Feller, An Introduction to Probability Theory and its Applications, John Wiley & Sons, New York, 1957. [6] R. S. Varga, Matrix Iterative Analysis, Springer-Verlag, New York, 2000.

Keywords and phrases: spectral radius, probability generating function method, non-negative matrices.