Related papers: On characterisation of Markov processes via martin…

This paper is addressed to the well-posedness of some linear and semilinear backward stochastic differential equations with general filtration, without using the Martingale Representation Theorem. The point of our approach is to introduce a…

We propose a new Markov chain Monte Carlo method in which trial configurations are generated by evolving a state, sampled from a prior distribution, using a Markov transition matrix. We present two prototypical algorithms and derive their…

In this paper, martingales related to simple random walks and their maximum process are investigated. First, a sufficient condition under which a function with three arguments, time, the random walk, and its maximum process becomes a…

Extreme-value theory for random vectors and stochastic processes with continuous trajectories is usually formulated for random objects all of whose univariate marginal distributions are identical. In the spirit of Sklar's theorem from…

Given a set-valued stochastic process $(V_t)_{t=0}^T$, we say that the martingale selection problem is solvable if there exists an adapted sequence of selectors $\xi_t\in V_t$, admitting an equivalent martingale measure. The aim of this…

We exhibit conditions under which the flow of marginal distributions of a discontinuous semimartingale $\xi$ can be matched by a Markov process, whose infinitesimal generator is expressed in terms of the local characteristics of $\xi$. Our…

We construct a family of genealogy-valued Markov processes that are induced by a continuous-time Markov population process. We derive exact expressions for the likelihood of a given genealogy conditional on the history of the underlying…

We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…

Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…

We consider a Markov control model in discrete time with countable both state space and action space. Using the value function of a suitable long-run average reward problem, we study various reachability/controllability problems. First, we…

We treat the class of universal Markov processes on the d-dimensional Euklidean space which do not depend on random. For these, as well as for several subclasses, we prove criteria whether a function f, defined on the positive half-line,…

We have studied Markov processes on denumerable state space and continuous time. We found that all these processes are connected via gauge transformations. We have used this result before as a method for resolution of equations, included…

Contrary to the theory of Markov processes, no general theory exists for the so called nonlinear Markov processes. We study an example of "nonlinear Markov process" related to classical probability theory, merely to random walks. This model…

Semi-Markov processes (SMPs) provide a rich framework for many real-world problems. However, due to difficulty implementing practical solutions they are rarely used with their full capability. The theory of SMPs is quite mature but was…

The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive n-th order…

For integers $n\geq r$, we treat the $r$th largest of a sample of size $n$ as an $\mathbb{R}^\infty$-valued stochastic process in $r$ which we denote $\mathbf{M}^{(r)}$. We show that the sequence regarded in this way satisfies the Markov…

We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…

We study group decision making with changing preferences as a Markov Decision Process. We are motivated by the increasing prevalence of automated decision-making systems when making choices for groups of people over time. Our main…

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…

We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…