Comments on the Perturbation Method
One of the most spectacular achievements of Julian Keilson is his development of the perturbation method based on the compensation kernel. The method is mathematically intriguing and also very convenient for practical applications.
Unable to display preview. Download preview PDF.
- Cai, H. On Reviving Markov Processes and Applications. Ph.D. thesis, Department of Mathematics, University of Maryland, 1987.Google Scholar
- Hille, E., and Phillips, R. S. Functional Analysis and Semi-Groups. Colloquium, American Mathematics Society, 1957.Google Scholar
- Keilson, J. The homogeneous random walk on the half-line and the Hilbert problem. Bull. I. S. I. 113, 33rd Session, paper 113, 1–13, 1961.Google Scholar
- Keilson, J. Green’s Function Methods in Probability Theory. Griffin, 1965.Google Scholar
- Keilson, J. The role of Green’s Functions in congestion theory. In: Smith, W. L., and Wilkinson, W. E. (eds), Congestion Theory. University of North Carolina Press, Chapel Hill, NC, 1965, pp. 43–71.Google Scholar
- Keilson, J. Markov chain models — rarity and exponentiality. Appl. Math. Sci. 28, 1979.Google Scholar
- Liu, N. Decomposition Theorems for Standard Processes. Ph.D. thesis, Department of Mathematics, University of Maryland, 1995.Google Scholar
- Loeve, M. Probability Theory. Van Nostrand, 1963.Google Scholar
- Neuts, M. F. Probability distributions of phase type. In: Liber Amicorum Professor Emeritus H. Florin, Department of Mathematics, University of Louvain, Belgium, 1975, pp. 173–206.Google Scholar
- Svoronou, A. Multivariate Markov Processes via the Green’s Function Method. Ph.D. thesis, Department of Statistics, University of Rochester, New York, 1990.Google Scholar