Advanced Search

Show simple item record

dc.contributor.authorBaşoğlu Kabran, Fatma
dc.contributor.authorSezer, Ali Devin
dc.date.accessioned2022-06-01T19:55:09Z
dc.date.available2022-06-01T19:55:09Z
dc.date.issued2020
dc.identifier.citationBaşoğlu Kabran, F., & Sezer, A. D. (2020). Approximation of the exit probability of a stable markov modulated constrained random walk. Annals of Operations Research, 310(2), 431-475.en_US
dc.identifier.issn0254-5330
dc.identifier.urihttps://doi.org/10.1007/s10479-020-03693-7
dc.identifier.urihttps://hdl.handle.net/20.500.12569/588
dc.description.abstractLet X be the constrained random walk on Z+2 having increments (1, 0), (-1,1), (0,-1) with jump probabilities ?(Mk) , ?1(Mk) , and ?2(Mk) where M is an irreducible aperiodic finite state Markov chain. The process X represents the lengths of two tandem queues with arrival rate ?(Mk) , and service rates ?1(Mk) , and ?2(Mk) ; the process M represents the random environment within which the system operates. We assume that the average arrival rate with respect to the stationary measure of M is less than the average service rates, i.e., X is assumed stable. Let ?n be the first time when the sum of the components of X equals n for the first time. Let Y be the random walk on Z× Z+ having increments (-1,0), (1, 1), (0,-1) with probabilities ?(Mk) , ?1(Mk) , and ?2(Mk). Supposing that the queues share a joint buffer of size n, pn=P(xn,m)(?n<?0) is the probability that this buffer overflows during a busy cycle of the system. To the best of our knowledge, the only methods currently available for the approximation of pn are classical large deviations analysis giving the exponential decay rate of pn and rare event simulation. Let ? be the first time the components of Y are equal. For x?R+2, x(1) + x(2) < 1 , x(1) > 0 , and xn= ? nx? , we show that P(n-xn(1),xn(2),m)(?<?) approximates P(xn,m)(?n<?0) with exponentially vanishing relative error as n? ?. For the analysis we define a characteristic matrix in terms of the jump probabilities of (X, M). The 0-level set of the characteristic polynomial of this matrix defines the characteristic surface; conjugate points on this surface and the associated eigenvectors of the characteristic matrix are used to define (sub/super) harmonic functions which play a fundamental role both in our analysis and the computation/approximation of P(y,m)(?< ?). © 2020, Springer Science+Business Media, LLC, part of Springer Nature.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.identifier.doi10.1007/s10479-020-03693-7
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAffine Transformationen_US
dc.subjectCharacteristic Surfaceen_US
dc.subjectExit Probabilitiesen_US
dc.subjectMarkov Modulationen_US
dc.subjectMultidimensional Constrained Random Walksen_US
dc.subjectQueueing Systemsen_US
dc.subjectRare Eventsen_US
dc.subjectRegime Switchen_US
dc.subjectSuperharmonic Functionsen_US
dc.titleApproximation of the exit probability of a stable Markov modulated constrained random walken_US
dc.typearticleen_US
dc.relation.journalAnnals of Operations Researchen_US
dc.departmentKavram MYOen_US
dc.authorid0000-0002-0212-5785
dc.identifier.volume310en_US
dc.identifier.issue2en_US
dc.identifier.startpage431en_US
dc.identifier.endpage475en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.department-tempBaşoğlu Kabran, F., Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey, Department of Finance, Banking and Insurance, İzmir Kavram Vocational School, Izmir, Turkey; Sezer, A.D., Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkeyen_US
dc.contributor.institutionauthorBaşoğlu Kabran, Fatma
dc.identifier.scopus2-s2.0-85087412482en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record