Skip to main content

Inverting the Transforms Arising in the \(GI/M/1\) Risk Process Using Roots

  • Conference paper
  • First Online:
Mathematics and Computing 2013

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 91))

Abstract

We consider an insurance risk model for which the claim arrival process is a renewal process and the sizes of claims occur an exponentially distributed random variable. For this risk process, we give an explicit expression for the distribution of probability of ultimate ruin, the expected time to ruin and the distribution of deficit at the time of ruin, using Padé-Laplace method. We have derived results about ultimate ruin probability and the time to ruin in the renewal risk model from its dual queueing model. Also, we derive the bounds for the moments of recovery time. Finally, some numerical results have been presented in the form of tables which compare these results with some of the existing results available in the literature.

The second author received partial financial support from the Department of Science and Technology, New Delhi, India research grant SR/FTP/MS-003/2012. The third author’s research work was partially supported by NSERC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akar, N., Arikan, E.: A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations. Queueing Syst. 22, 97–120 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Asmussen, S., Albrecher, H.: Ruin probabilities, vol. 14. World Scientific, New Jersey (2010)

    Google Scholar 

  3. Asmussen, S., Rolski, T.: Computational methods in risk theory: a matrix-algorithmic approach. Insur. Math. Econ. 10(4), 259–274 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Botta, R.F., Harris, C.M., Marchal, W.G.: Characterization of generalized hyperexponential distribution functions. Stoch. Models 3(1), 115–148 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dickson, D., Hipp, C.: Ruin probabilities for erlang (2) risk processes. Insur. Math. Econ. 22(3), 251–262 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Frostig, E.: Upper bounds on the expected time to ruin and on the expected recovery time. Adv. Appl. Probab. 36, 377–397 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Komota, Y., Nogami, S., Hoshiko, Y.: Analysis of the \(GI/G/1\) queue by the supplementary variable approach. Electron. Commun. Jpn. 66(A-5), 10–19 (1983)

    Google Scholar 

  8. Prabhu, N.U.: On the ruin problem of collective risk theory. The Ann. Math. Stat. 32(3), 757–764 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  9. Thampi, K., Jacob, M.: On a class of renewal queueing and risk processes. J. Risk Finance 11(2), 204–220 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. D. Banik .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Panda, G., Banik, A.D., Chaudhry, M.L. (2014). Inverting the Transforms Arising in the \(GI/M/1\) Risk Process Using Roots. In: Mohapatra, R., Giri, D., Saxena, P., Srivastava, P. (eds) Mathematics and Computing 2013. Springer Proceedings in Mathematics & Statistics, vol 91. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1952-1_20

Download citation

Publish with us

Policies and ethics