Related papers: Some notes on a semi-Markov matrix occurring in th…
A single queueing system with time-dependent exponentially distributed arrival processes and exponential machine processes (Kendall notation $M_t/M_t/1$) is analyzed. Modeling the time evolution for the discrete queue-length distribution by…
We study a model of a polling system, that is, a collection of $d$ queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is…
This paper addresses a key limitation in existing counterfactual inference methods for Markov Decision Processes (MDPs). Current approaches assume a specific causal model to make counterfactuals identifiable. However, there are usually many…
Semi-Markov models are widely used for survival analysis and reliability analysis. In general, there are two competing parameterizations and each entails its own interpretation and inference properties. On the one hand, a semi-Markov…
We develop a martingale approximation approach to studying the limiting behavior of quadratic forms of Markov chains. We use the technique to examine the asymptotic behavior of lag-window estimators in time series and we apply the results…
We extend the class of semimartingales in a natural way. This allows us to incorporate processes having paths that leave the state space R^d. In particular Markov processes related to sub-Markovian kernels, but also non-Markovian processes…
We study discrete time Markov processes with periodic or open boundary conditions and with inhomogeneous rates in the bulk. The Markov matrices are given by the inhomogeneous transfer matrices introduced previously to prove the…
We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…
The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new…
Inference for partially observed Markov process models has been a longstanding methodological challenge with many scientific and engineering applications. Iterated filtering algorithms maximize the likelihood function for partially observed…
Classical linear regression is considered for a case when regression parameters depend on the external random environment. The last is described as a continuous time Markov chain with finite state space. Here the expected sojourn times in…
Semi-Markov processes represent a well known and widely used class of random processes in classical probability theory. Here, we develop an extension of this type of non-Markovian dynamics to the quantum regime. This extension is…
The complete framework for the $\epsilon$-machine construction of the one dimensional Ising model is presented correcting previous mistakes on the subject. The approach follows the known treatment of the Ising model as a Markov random…
Markov decision processes continue to gain in popularity for modeling a wide range of applications ranging from analysis of supply chains and queuing networks to cognitive science and control of autonomous vehicles. Nonetheless, they tend…
Studying the behaviour of Markov processes at boundary points of the state space has a long history, dating back all the way to William Feller. With different motivations in mind entrance and exit questions have been explored for different…
In this paper, we derive comparison results for terminal values of $d$-dimensional special semimartingales and also for finite-dimensional distributions of multivariate L\'{e}vy processes. The comparison is with respect to nondecreasing,…
We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint…
Recently multiserver queues with setup times have been extensively studied because they have applications in power-saving data centers. The most challenging model is the M/M/$c$/Setup queue where a server is turned off when it is idle and…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
In this work, we propose a machine learning-based approach to address a specific aspect of the Quantum Marginal Problem: reconstructing a global density matrix compatible with a given set of quantum marginals. Our method integrates a…