Multivariate Risk Processes with Interacting Intensities
|
|
- Jeffery Charles
- 5 years ago
- Views:
Transcription
1 Multivariate Risk Processes with Interacting Intensities Nicole Bäuerle (joint work with Rudolf Grübel) Luminy, April 2010
2 Outline Multivariate pure birth processes Multivariate Risk Processes Fluid Limits Directionally Mixed Poisson Models Attracting Intensities
3 A Multivariate Pure Birth Process Let N = (N(t)) t 0 with N(t) = (N 1 (t),..., N d (t)) be a vector process consisting of d one-dim. counting processes s.t. IP [ N(t + h) = k + e j N(t) = k ] = hβ j (k) + o(h) as h 0, for all k = (k 1,..., k d ) Z d +. We assume that β(k) > 0 for all k Z d +, η := sup k E β(k) <. Interpretation: N j (t) = number of claims in business line j up to time t.
4 Examples (d = 2) β 1 = β 2 1/2. β 1 (k 1, k 2 ) = 1+k 1 2+k 1 +k 2, β 2 (k 1, k 2 ) = 1+k 2 2+k 1 +k 2 Repelling. β 1 (k 1, k 2 ) = 1+k 2 2+k 1 +k 2, β 2 (k 1, k 2 ) = 1+k 1 2+k 1 +k 2 Attracting.
5 Examples (d = 2)
6 Examples (d = 2)
7 Dependence Structure A Markov process X is said to be stochastically monotone if x IE [ f (X(t)) X(s) = x ] is increasing for all increasing f : R d R and for all 0 s < t. A Markov process X is said to be associated if X(t 1 ),..., X(t n ) is associated for all 0 t 1 <... < t n, n N. Theorem If β is increasing, then N is stochastically monotone and associated.
8 Risk Models d business lines labeled j = 1,..., d. Claim sizes (U j,k ) k N are independent with distribution Q j, mean µ j and finite second moment. Premium income rate c j > 0 for the j-th business line. The multivariate risk reserve process R = (R t ) t 0 is then defined by R(t) = (R 1 (t),..., R d (t)), with R j (t) := R j (0) + c j t N j (t) k=1 U j,k for all t 0.
9 Fluid Limits Introduce scaling parameter γ > 0, N γ j (t) = 1 γ N j(γt), and R γ j (t) = R j (0) + c j t 1 γ In R d we have the probability simplex N j (γt) W d := { (x 1,..., x d ) R d + : x x d = 1 }. We assume that for a.a. x W d and all (x n ) n N R d +, lim x n =, n lim n k=1 U j,k x n = x = lim x n β( x n ) = β(x). n and extend β to R d + \ {0} by β(x) := β( x 1 x).
10 Examples of Fluid Scaling
11 Fluid Limits Theorem Every sequence (γ(k)) k N (0, ) with γ(k) has a subsequence (γ(k(l))) l N such that N γ(k(l)) φ, R γ(k(l)) r as l. Further, the paths of the limit processes φ and r are almost surely absolutely continuous, and satisfy φ(t) = t where x y = (x 1 y 1,..., x d y d ). 0 β ( φ(s) ) ds. r(t) = r(0) + ct µ φ(t).
12 Examples β 1 = β 2 1/2, then φ(t) = (t/2, t/2). 1, if k 2 = k 1 + 1, 1, if k 1 = k 2 + 1, β 1 (k 1, k 2 ) = 1 2, if k 2 = k 1, β 2 (k 1, k 2 ) = 1 2, if k 2 = k 1, 0, otherwise, 0, otherwise. Again φ(t) = (t/2, t/2).
13 Models with Repelling Intensities Assume that β 1 (k 1, k 2 ) = 1 + k k 1 + k 2, β 2 (k 1, k 2 ) = 1 + k k 1 + k 2. β exists and is given by β 1 (x 1, x 2 ) = x 1 x 1 + x 2, β 2 (x 1, x 2 ) = x 2 x 1 + x 2 for all x 1, x 2 R 2 +\{0}. The associated fluid limit equation has a whole family {φ α (t) = ( αt, (1 α)t ) : 0 α 1} of solutions. Relation to the Polya Eggenberger urn model provides an U U(0, 1) s.t. 1 γ N(γt) ( Ut (1 U)t ), γ.
14 Models with Repelling Intensities In particular the fluid limit of the first risk process is r 1 (t) = r 1 (0) + c 1 t µ 1 Ut, t 0. 1 If c 1 = µ δ for δ > 0 we obtain ψ 1 (u) = IP(R 1 1 (t) < 0 for some t 0 R1 1 (0) = u) ψ 1 (uγ) IP(R γ 1 (t) < 0 Rγ 1 (0) = u), γ 1, t > 0 ( IP U > δ + 1 ) = 1 µ δ. µ 1 In particular ψ 1 (u) 0 for u.
15 Directionally Mixed Poisson Models Let Z be a r.v. with values in W d and distribution ν. Let L be a Poisson process with intensity λ. Given Z = (z 1,..., z d ), construct N = (N 1,..., N d ) by independently assigning the events of L to the j-th component with probability z j. Theorem N is a time-homogeneous Markov chain with intensities β j (k) = λ IE Z k+e j IE Z k for all k E, where x k = x k x k d d. The fluid limit for N is of the form φ(t) = tλz for all t 0.
16 Example The model with repelling intensities fits into the framework of directionally mixed Poisson models by setting d = 2, λ = 1, Z := (U, 1 U) where U U(0, 1). This gives β 1 (k 1, k 2 ) = IE Uk 1+1 (1 U) k 2 IE U k 1 (1 U) k 2 = 1 + k k 1 + k 2.
17 Ruin Asymptotics for Directionally Mixed Models Consider the d-dimensional risk reserve process R = (R 1,..., R d ) with H j (t) := e tx Q j (dx) < for some t > 0, lim H j (t) = with t 0 := sup{t > 0 : H j (t) < }. t t0 Let R 0 (t) := R 1 (t) R d (t) and ψ 0 (u) := IP(R 0 (t) < 0 for some t 0 R 0 (0) = u).
18 Ruin Asymptotics for Directionally Mixed Models Theorem Suppose that c > λ sup{ z, µ : z supp(ν)}. Then ψ 0 (u) e κ0u 1 for all u > 0, lim u u log ψ 0(u) = κ 0, where the Lundberg exponent κ 0 is given by κ 0 = inf{κ(z) : z supp(ν)} and κ(z) is the Lundberg exponent for the one-dimensional model with premium income rate c, claim arrival intensity λ and claim size distribution d j=1 z jq j.
19 Attracting Intensities Suppose that β 1 (k 1, k 2 ) = 1+k 2 2+k 1 +k 2, β 2 (k 1, k 2 ) = 1+k 1 2+k 1 +k 2 and define Q := 1 2 Q Q 2 and H (r) = e rx Q (dx). Theorem Suppose that c > (µ 1 + µ 2 )/2 and that Q 1 st Q 2 or Q 2 st Q 1. Then it holds that 1 lim u u log ψ 0(u) = κ, where κ is the Lundberg exponent for the one-dimensional model with premium income rate c, claim arrival intensity 1 and claim size distribution Q.
20 References Bäuerle, N., Grübel, R. (2008) : Multivariate risk processes with interacting intensities. Adv. Appl. Prob., 40: Glynn P.W., Whitt W. (1994) : Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Prob. 31A: Liggett, T.M. (1985) : Interacting particle systems. Springer, New York. Zocher, M. (2005) : Multivariate mixed Poisson processes. Doctoral Thesis, TU Dresden Thank you very much for your attention!
MULTIVARIATE RISK PROCESSES WITH INTERACTING INTENSITIES
Applied Probability Trust (27 March 2008) MULTIVARIATE RISK PROCESSES WITH INTERACTING INTENSITIES NICOLE BÄUERLE, Universität Karlsruhe (TH) RUDOLF GRÜBEL, Leibniz Universität Hannover Abstract The classical
More informationMULTIVARIATE RISK PROCESSES WITH INTERACTING INTENSITIES
Adv Appl Prob 40, 578 601 (2008) Printed in Northern Ireland Applied Probability Trust 2008 MULTIVARIATE RISK PROCESSES WITH INTERACTING INTENSITIES NICOLE BÄUERLE, Universität Karlsruhe (TH) RUDOLF GRÜBEL,
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationUniversity Of Calgary Department of Mathematics and Statistics
University Of Calgary Department of Mathematics and Statistics Hawkes Seminar May 23, 2018 1 / 46 Some Problems in Insurance and Reinsurance Mohamed Badaoui Department of Electrical Engineering National
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationRare event simulation for the ruin problem with investments via importance sampling and duality
Rare event simulation for the ruin problem with investments via importance sampling and duality Jerey Collamore University of Copenhagen Joint work with Anand Vidyashankar (GMU) and Guoqing Diao (GMU).
More informationModèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine
Séminaire de Statistiques de l'irma Modèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine Romain Biard LMB, Université de Franche-Comté en collaboration avec
More informationA Dynamic Contagion Process with Applications to Finance & Insurance
A Dynamic Contagion Process with Applications to Finance & Insurance Angelos Dassios Department of Statistics London School of Economics Angelos Dassios, Hongbiao Zhao (LSE) A Dynamic Contagion Process
More informationPoisson Processes. Stochastic Processes. Feb UC3M
Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written
More informationFinite-time Ruin Probability of Renewal Model with Risky Investment and Subexponential Claims
Proceedings of the World Congress on Engineering 29 Vol II WCE 29, July 1-3, 29, London, U.K. Finite-time Ruin Probability of Renewal Model with Risky Investment and Subexponential Claims Tao Jiang Abstract
More informationFunctional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals
Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico
More informationIntroduction to Rare Event Simulation
Introduction to Rare Event Simulation Brown University: Summer School on Rare Event Simulation Jose Blanchet Columbia University. Department of Statistics, Department of IEOR. Blanchet (Columbia) 1 / 31
More informationRare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions
Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk The University of
More informationThreshold dividend strategies for a Markov-additive risk model
European Actuarial Journal manuscript No. will be inserted by the editor Threshold dividend strategies for a Markov-additive risk model Lothar Breuer Received: date / Accepted: date Abstract We consider
More informationAsymptotics of random sums of heavy-tailed negatively dependent random variables with applications
Asymptotics of random sums of heavy-tailed negatively dependent random variables with applications Remigijus Leipus (with Yang Yang, Yuebao Wang, Jonas Šiaulys) CIRM, Luminy, April 26-30, 2010 1. Preliminaries
More informationUpper and lower bounds for ruin probability
Upper and lower bounds for ruin probability E. Pancheva,Z.Volkovich and L.Morozensky 3 Institute of Mathematics and Informatics, the Bulgarian Academy of Sciences, 3 Sofia, Bulgaria pancheva@math.bas.bg
More informationA Note On The Erlang(λ, n) Risk Process
A Note On The Erlangλ, n) Risk Process Michael Bamberger and Mario V. Wüthrich Version from February 4, 2009 Abstract We consider the Erlangλ, n) risk process with i.i.d. exponentially distributed claims
More informationExtremes and ruin of Gaussian processes
International Conference on Mathematical and Statistical Modeling in Honor of Enrique Castillo. June 28-30, 2006 Extremes and ruin of Gaussian processes Jürg Hüsler Department of Math. Statistics, University
More informationThe Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation.
The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation. Binghamton University Department of Mathematical Sciences
More informationTales of Time Scales. Ward Whitt AT&T Labs Research Florham Park, NJ
Tales of Time Scales Ward Whitt AT&T Labs Research Florham Park, NJ New Book Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues Springer 2001 I won t
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationUpper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process
Λ4flΛ4» ν ff ff χ Vol.4, No.4 211 8fl ADVANCES IN MATHEMATICS Aug., 211 Upper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process HE
More informationReduced-load equivalence for queues with Gaussian input
Reduced-load equivalence for queues with Gaussian input A. B. Dieker CWI P.O. Box 94079 1090 GB Amsterdam, the Netherlands and University of Twente Faculty of Mathematical Sciences P.O. Box 17 7500 AE
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationAnalysis of the ruin probability using Laplace transforms and Karamata Tauberian theorems
Analysis of the ruin probability using Laplace transforms and Karamata Tauberian theorems Corina Constantinescu and Enrique Thomann Abstract The classical result of Cramer-Lundberg states that if the rate
More informationTMA4265 Stochastic processes ST2101 Stochastic simulation and modelling
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 7 English Contact during examination: Øyvind Bakke Telephone: 73 9 8 26, 99 4 673 TMA426 Stochastic processes
More informationManual for SOA Exam MLC.
Chapter 10. Poisson processes. Section 10.5. Nonhomogenous Poisson processes Extract from: Arcones Fall 2009 Edition, available at http://www.actexmadriver.com/ 1/14 Nonhomogenous Poisson processes Definition
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 7
MS&E 321 Spring 12-13 Stochastic Systems June 1, 213 Prof. Peter W. Glynn Page 1 of 7 Section 9: Renewal Theory Contents 9.1 Renewal Equations..................................... 1 9.2 Solving the Renewal
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationIrreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1
Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationLecture Notes on Risk Theory
Lecture Notes on Risk Theory February 2, 21 Contents 1 Introduction and basic definitions 1 2 Accumulated claims in a fixed time interval 3 3 Reinsurance 7 4 Risk processes in discrete time 1 5 The Adjustment
More informationABC methods for phase-type distributions with applications in insurance risk problems
ABC methods for phase-type with applications problems Concepcion Ausin, Department of Statistics, Universidad Carlos III de Madrid Joint work with: Pedro Galeano, Universidad Carlos III de Madrid Simon
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationStability of the Defect Renewal Volterra Integral Equations
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 211 http://mssanz.org.au/modsim211 Stability of the Defect Renewal Volterra Integral Equations R. S. Anderssen,
More informationLecture 4a: Continuous-Time Markov Chain Models
Lecture 4a: Continuous-Time Markov Chain Models Continuous-time Markov chains are stochastic processes whose time is continuous, t [0, ), but the random variables are discrete. Prominent examples of continuous-time
More informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
More informationOn Optimal Stopping Problems with Power Function of Lévy Processes
On Optimal Stopping Problems with Power Function of Lévy Processes Budhi Arta Surya Department of Mathematics University of Utrecht 31 August 2006 This talk is based on the joint paper with A.E. Kyprianou:
More informationLECTURE #6 BIRTH-DEATH PROCESS
LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death
More informationON THE MOMENTS OF ITERATED TAIL
ON THE MOMENTS OF ITERATED TAIL RADU PĂLTĂNEA and GHEORGHIŢĂ ZBĂGANU The classical distribution in ruins theory has the property that the sequence of the first moment of the iterated tails is convergent
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationAsymptotic Coupling of an SPDE, with Applications to Many-Server Queues
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with
More informationThe exact asymptotics for hitting probability of a remote orthant by a multivariate Lévy process: the Cramér case
The exact asymptotics for hitting probability of a remote orthant by a multivariate Lévy process: the Cramér case Konstantin Borovkov and Zbigniew Palmowski Abstract For a multivariate Lévy process satisfying
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationNon-Essential Uses of Probability in Analysis Part IV Efficient Markovian Couplings. Krzysztof Burdzy University of Washington
Non-Essential Uses of Probability in Analysis Part IV Efficient Markovian Couplings Krzysztof Burdzy University of Washington 1 Review See B and Kendall (2000) for more details. See also the unpublished
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationDiscrete Population Models with Asymptotically Constant or Periodic Solutions
International Journal of Difference Equations ISSN 0973-6069, Volume 6, Number 2, pp. 143 152 (2011) http://campus.mst.edu/ijde Discrete Population Models with Asymptotically Constant or Periodic Solutions
More informationRuin probabilities of the Parisian type for small claims
Ruin probabilities of the Parisian type for small claims Angelos Dassios, Shanle Wu October 6, 28 Abstract In this paper, we extend the concept of ruin in risk theory to the Parisian type of ruin. For
More informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationMarkov Repairable Systems with History-Dependent Up and Down States
Markov Repairable Systems with History-Dependent Up and Down States Lirong Cui School of Management & Economics Beijing Institute of Technology Beijing 0008, P.R. China lirongcui@bit.edu.cn Haijun Li Department
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
More informationOn critical branching processes with immigration in varying environment
On critical branching processes with immigration in varying environment Márton Ispány Faculty of Informatics, University of Debrecen Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationLiquidation in Limit Order Books. LOBs with Controlled Intensity
Limit Order Book Model Power-Law Intensity Law Exponential Decay Order Books Extensions Liquidation in Limit Order Books with Controlled Intensity Erhan and Mike Ludkovski University of Michigan and UCSB
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationReinsurance and ruin problem: asymptotics in the case of heavy-tailed claims
Reinsurance and ruin problem: asymptotics in the case of heavy-tailed claims Serguei Foss Heriot-Watt University, Edinburgh Karlovasi, Samos 3 June, 2010 (Joint work with Tomasz Rolski and Stan Zachary
More informationA polynomial expansion to approximate ruin probabilities
A polynomial expansion to approximate ruin probabilities P.O. Goffard 1 X. Guerrault 2 S. Loisel 3 D. Pommerêt 4 1 Axa France - Institut de mathématiques de Luminy Université de Aix-Marseille 2 Axa France
More informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
More informationApproximating the Integrated Tail Distribution
Approximating the Integrated Tail Distribution Ants Kaasik & Kalev Pärna University of Tartu VIII Tartu Conference on Multivariate Statistics 26th of June, 2007 Motivating example Let W be a steady-state
More informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationBirth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes
DTU Informatics 247 Stochastic Processes 6, October 27 Today: Limiting behaviour of birth and death processes Birth and death processes with absorbing states Finite state continuous time Markov chains
More informationSTEADY STATE AND SCALING LIMIT FOR A TRAFFIC CONGESTION MODEL
STEADY STATE AND SCALING LIMIT FOR A TRAFFIC CONGESTION MODEL ILIE GRIGORESCU AND MIN KANG Abstract. In a general model used in internet congestion control, the time dependent data flow vector x(t) > undergoes
More informationSample path large deviations of a Gaussian process with stationary increments and regularily varying variance
Sample path large deviations of a Gaussian process with stationary increments and regularily varying variance Tommi Sottinen Department of Mathematics P. O. Box 4 FIN-0004 University of Helsinki Finland
More informationHJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011
Department of Probability and Mathematical Statistics Faculty of Mathematics and Physics, Charles University in Prague petrasek@karlin.mff.cuni.cz Seminar in Stochastic Modelling in Economics and Finance
More informationHawkes Processes and their Applications in Finance and Insurance
Hawkes Processes and their Applications in Finance and Insurance Anatoliy Swishchuk University of Calgary Calgary, Alberta, Canada Hawks Seminar Talk Dept. of Math. & Stat. Calgary, Canada May 9th, 2018
More informationFunctional Limit Theorems for A New Class of Non-Stationary Shot Noise Processes
Functional Limit Theorems for A New Class of Non-Stationary Shot Noise Processes GUODONG PANG AND YUHANG ZHOU Abstract. We study a class of non-stationary shot noise processes which have a general arrival
More informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
More informationAverage-cost temporal difference learning and adaptive control variates
Average-cost temporal difference learning and adaptive control variates Sean Meyn Department of ECE and the Coordinated Science Laboratory Joint work with S. Mannor, McGill V. Tadic, Sheffield S. Henderson,
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationM/M/1 Retrial Queueing System with Negative. Arrival under Erlang-K Service by Matrix. Geometric Method
Applied Mathematical Sciences, Vol. 4, 21, no. 48, 2355-2367 M/M/1 Retrial Queueing System with Negative Arrival under Erlang-K Service by Matrix Geometric Method G. Ayyappan Pondicherry Engineering College,
More informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy Gideon Weiss Haifa Statistics Seminar May 5, 2008 1 Outline 1 Preview of Results 2 Introduction Queueing
More informationarxiv: v1 [q-fin.rm] 27 Jun 2017
Risk Model Based on General Compound Hawkes Process Anatoliy Swishchuk 1 2 arxiv:1706.09038v1 [q-fin.rm] 27 Jun 2017 Abstract: In this paper, we introduce a new model for the risk process based on general
More informationRuin probabilities in multivariate risk models with periodic common shock
Ruin probabilities in multivariate risk models with periodic common shock January 31, 2014 3 rd Workshop on Insurance Mathematics Universite Laval, Quebec, January 31, 2014 Ruin probabilities in multivariate
More informationAsymptotics for posterior hazards
Asymptotics for posterior hazards Pierpaolo De Blasi University of Turin 10th August 2007, BNR Workshop, Isaac Newton Intitute, Cambridge, UK Joint work with Giovanni Peccati (Université Paris VI) and
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationA Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.7J Fall 213 Lecture 22 12/9/213 Skorokhod Mapping Theorem. Reflected Brownian Motion Content. 1. G/G/1 queueing system 2. One dimensional reflection mapping
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationCentral limit theorems for ergodic continuous-time Markov chains with applications to single birth processes
Front. Math. China 215, 1(4): 933 947 DOI 1.17/s11464-15-488-5 Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes Yuanyuan LIU 1, Yuhui ZHANG 2
More informationON COMPOUND POISSON POPULATION MODELS
ON COMPOUND POISSON POPULATION MODELS Martin Möhle, University of Tübingen (joint work with Thierry Huillet, Université de Cergy-Pontoise) Workshop on Probability, Population Genetics and Evolution Centre
More informationRuin Probabilities of a Discrete-time Multi-risk Model
Ruin Probabilities of a Discrete-time Multi-risk Model Andrius Grigutis, Agneška Korvel, Jonas Šiaulys Faculty of Mathematics and Informatics, Vilnius University, Naugarduko 4, Vilnius LT-035, Lithuania
More informationLIMITS AND APPROXIMATIONS FOR THE M/G/1 LIFO WAITING-TIME DISTRIBUTION
LIMITS AND APPROXIMATIONS FOR THE M/G/1 LIFO WAITING-TIME DISTRIBUTION by Joseph Abate 1 and Ward Whitt 2 April 15, 1996 Revision: January 2, 1997 Operations Research Letters 20 (1997) 199 206 1 900 Hammond
More information2008 Hotelling Lectures
First Prev Next Go To Go Back Full Screen Close Quit 1 28 Hotelling Lectures 1. Stochastic models for chemical reactions 2. Identifying separated time scales in stochastic models of reaction networks 3.
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 3: Regenerative Processes Contents 3.1 Regeneration: The Basic Idea............................... 1 3.2
More information