Abstract
We extend the framework of Neuts’ matrix analytic approach to a reflected process generated by a discrete time multidimensional Markov additive process. This Markov additive process has a general background state space and a real vector valued additive component, and generates a multidimensional reflected process. Our major interest is to derive a closed form formula for the stationary distribution of this reflected process. To this end, we introduce a real valued level, and derive new versions of the Wiener-Hopf factorization for the Markov additive process with the multidimensional additive component. In particular, it is represented by moment generating functions, and we consider the domain for it to be valid. Our framework is general enough to include multi-server queues and/or queueing networks as well as non-linear time series which are currently popular in financial and actuarial mathematics. Our results yield structural results for such models. As an illustration, we apply our results to extend existing results on the tail behavior of reflected processes. A major theme of this work is to connect recent work on matrix analytic methods to classical probabilistic studies on Markov additive processes. Indeed, using purely probabilistic methods such as censoring, duality, level crossing and time-reversal (which are known in the matrix analytic methods community but date back to Arjas & Speed [2] and Pitman [29]), we extend and unify existing results in both areas.
Highlights
The complexity of applied probability models has significantly increased over the last decades
The minimal sub-invariant measure is known to be proportional to an occupation measure, i.e., the expected sojourn time before returning to an appropriately chosen base set, so the sub-invariant measure π can not be finite if K is transient, while any sub-invariant measure must be invariant if K is recurrent
This is an improvement of the logarithmic asymptotics which follows from the standard framework of Glynn & Whitt [12]
Summary
Publication details, including instructions for authors and subscription information: http://pubsonline.informs.org. Full terms and conditions of use: https://pubsonline.informs.org/Publications/Librarians-Portal/PubsOnLine-Terms-andConditions. The Publisher does not warrant or guarantee the article’s accuracy, completeness, merchantability, fitness for a particular purpose, or non-infringement. Descriptions of, or references to, products or publications, or inclusion of an advertisement in this article, neither constitutes nor implies a guarantee, endorsement, or support of claims made of that product, publication, or service. With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.) and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to transform strategic visions and achieve better outcomes. For more information on INFORMS, its publications, membership, or meetings visit http://www.informs.org
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have