IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v27y2025i4d10.1007_s11009-025-10207-0.html
   My bibliography  Save this article

Introduction, Analysis and Limiting Behaviour of a Multi-Level Nonhomogeneous Semi-Markov System with a Reducible Embedded Markov Chain

Author

Listed:
  • V. A. Dimitriou

    (Aristotle University of Thessaloniki)

  • A. A. Papadopoulou

    (Aristotle University of Thessaloniki)

Abstract

In this paper, we introduce and define the concept of the multi-level nonhomogeneous semi-Markov system. The suggested modelling approach incorporates, for the first time, mobility patterns concerning transitions within or among the departments of an organisation in a semi-Markov context. In this sense, it generalises on the one hand previous Markov departmental models and on the other hand enriches the embedded semi-Markov chain of the system with the characteristic of reducibility. The proposed system is assumed to be open, so, apart from the intra- and inter-departmental mobility, recruitments and departments are also defined. In the first part of the paper, iterative equations are provided for the interval transition probabilities as well as for the system’s structure in order to fully describe the system’s evolution through time. The study of the limiting behaviour of the system follows. Towards this goal, we determine initially the limiting probabilities of the embedded reducible non-homogeneous Markov chain, which allows us in turn to specify the limiting probabilities of the reducible non-homogeneous semi-Markov chain. On the basis of these, the limiting transition probabilities and the limiting population departmental structure of the system are found, under certain conditions. Last, the theoretical results are illustrated numerically with representative data of manpower systems.

Suggested Citation

  • V. A. Dimitriou & A. A. Papadopoulou, 2025. "Introduction, Analysis and Limiting Behaviour of a Multi-Level Nonhomogeneous Semi-Markov System with a Reducible Embedded Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 27(4), pages 1-27, December.
  • Handle: RePEc:spr:metcap:v:27:y:2025:i:4:d:10.1007_s11009-025-10207-0
    DOI: 10.1007/s11009-025-10207-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-025-10207-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-025-10207-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:27:y:2025:i:4:d:10.1007_s11009-025-10207-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.