Related papers: Markov additive friendships
When is it possible to interpret a given Markov process as a L\'evy-like process? Since the class of L\'evy processes can be defined by the relation between transition probabilities and convolutions, the answer to this question lies in the…
In this paper we introduce a new class of L\'evy processes which we call hypergeometric-stable L\'evy processes, because they are obtained from symmetric stable processes through several transformations and where the Gauss hypergeometric…
We prove simple general formulas for expectations of functions of a L\'evy process and its running extremum. Under additional conditions, we derive analytical formulas using the Fourier/Laplace inversion and Wiener-Hopf factorization, and…
This paper concerns the Vertex Reinforced Jump Process (VRJP) and its representations as a Markov process in random environment. We show that all possible representations of the VRJP as a mixture of Markov processes can be expressed in a…
We study general Markov additive processes when the state space of the modulator is a Polish space. Under some regularity assumptions, our main result is the characterization of the long-time behavior of the ordinate in terms of the…
We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as…
The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…
We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height…
A long-standing goal of social network research has been to alter the properties of network to achieve the desired outcome. In doing so, DeGroot's consensus model has served as the popular choice for modeling the information diffusion and…
The Lax-Hopf formula simplifies the value function of an intertemporal optimization (infinite dimensional) problem associated with a convex transaction-cost function which depends only on the transactions (velocities) of a commodity…
We consider Markov decision processes where the state of the chain is only given at chosen observation times and of a cost. Optimal strategies involve the optimisation of observation times as well as the subsequent action values. We…
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…
Markovian maximal couplings of Markov processes are characterized by an equality of total variation and a distance of Wasserstein type. If a Markovian maximal coupling is a Feller process, the generator can be calculated, e.g. for…
Markov Decision Processes (MDPs) have been used to formulate many decision-making problems in science and engineering. The objective is to synthesize the best decision (action selection) policies to maximize expected rewards (or minimize…
This article treats both discrete time and continuous time stopping problems for general Markov processes on the real line with general linear costs. Using an auxiliary function of maximum representation type, conditions are given to…
This paper considers discretization of the L\'evy process appearing in the Lamperti representation of a strictly positive self-similar Markov process. Limit theorems for the resulting approximation are established under some regularity…
By killing a stable L\'{e}vy process when it leaves the positive half-line, or by conditioning it to stay positive, or by conditioning it to hit 0 continuously, we obtain three different positive self-similar Markov processes which…
Explicit solutions to the non-linear field equations of some gravitational theories can be obtained, by means of a Riemann-Hilbert approach, from a canonical Wiener-Hopf factorisation of certain matrix functions called monodromy matrices.…
In the L\'evy construction of Brownian motion, a Haar-derived basis of functions is used to form a finite-dimensional process $W^{N}$ and to define the Wiener process as the almost sure path-wise limit of $W^{N}$ when $N$ tends to infinity.…
Consider a Markov chain $\{X_n\}_{n\ge 0}$ with an ergodic probability measure $\pi$. Let $\Psi$ a function on the state space of the chain, with $\alpha$-tails with respect to $\pi$, $\alpha\in (0,2)$. We find sufficient conditions on the…