Related papers: Wiener-Hopf factorization for time-inhomogeneous M…
This work contributes to the theory of Wiener-Hopf type factorization for finite Markov chains. This theory originated in the seminal paper Barlow et al. (1980), which treated the case of finite time-homogeneous Markov chains. Since then,…
This paper reviews the modern state of the Wiener--Hopf factorization method and its generalizations. The main constructive results for matrix Wiener--Hopf are presented, approximation methods are outlined and the main areas of applications…
We consider the Wiener--Hopf factorization problem for a matrix function that is completely defined by its first column: the succeeding columns are obtained from the first one by means of a finite group of permutations. The symmetry of this…
We prove the Wiener-Hopf factorization for Markov Additive processes. We derive also Spitzer-Rogozin theorem for this class of processes which serves for obtaining Kendall's formula and Fristedt representation of the cumulant matrix of the…
In this paper, we study a notion of local stationarity for discrete time Markov chains which is useful for applications in statistics. In the spirit of some locally stationary processes introduced in the literature, we consider triangular…
In [16], under mild conditions, a Wiener-Hopf type factorization is derived for the exponential functional of proper L\'evy processes. In this paper, we extend this factorization by relaxing a finite moment assumption as well as by…
We consider a Markov additive process with a finite phase space and study its path decompositions at the times of extrema, first passage and last exit. For these three families of times we establish splitting conditional on the phase, and…
For a spectrally negative positive self-similar Markov process with an a.s. finite overall supremum we provide, in tractable detail, a kind of conditional Wiener-Hopf factorization at the maximum of the absorption time at zero, the…
This paper analyzes the factorizability and geometry of transition matrices of multivariate Markov chains. Specifically, we demonstrate that the induced chains on factors of a product space can be regarded as information projections with…
We derive the L\'evy-Khintchine representation of the Wiener-Hopf factors for the Normal Inverse Gaussian (NIG) process as well as a representation which is similar to the moment generating function (MGF) of a generalized gamma convolution…
In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…
Imprecise continuous-time Markov chains are a robust type of continuous-time Markov chains that allow for partially specified time-dependent parameters. Computing inferences for them requires the solution of a non-linear differential…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…
The Wiener-Hopf equations are a Toeplitz system of linear equations that naturally arise in several applications in time series. These include the update and prediction step of the stationary Kalman filter equations and the prediction of…
A method is proposed to reconstruct a cyclic time-inhomogeneous Markov pro- cess from measured data. First, a time-inhomogeneous Markov model is fit to the data, taken here from measurements on a wind turbine. From the time-dependent…
We introduce a novel time-homogeneous Markov embedding of a class of time inhomogeneous Markov chains widely used in the context of Monte Carlo sampling algorithms which allows us to answer one of the most basic, yet hard, question about…
We present a novel approach to quantizing Markov chains. The approach is based on the Markov chain coupling method, which is frequently used to prove fast mixing. Given a particular coupling, e.g., a grand coupling, we construct a…
We characterize the value function and the optimal stopping time for a large class of optimal stopping problems where the underlying process to be stopped is a fairly general Markov process. The main result is inspired by recent findings…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
We consider the computational task of sampling a bit string $x$ from a distribution $\pi(x)=|\langle x|\psi\rangle|^2$, where $\psi$ is the unique ground state of a local Hamiltonian $H$. Our main result describes a direct link between the…