Related papers: Randomly switched vector fields sharing a zero on …

Recently, the theory concerning piecewise smooth vector fields (PSVFs for short) have been undergoing important improvements. In fact, many results obtained do not have an analogous for smooth vector fields. For example, the chaoticity of…

We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting…

We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…

An edge switch is an operation which makes a local change in a graph while maintaining the degree of every vertex. We introduce a switch move, called a triangle switch, which creates or deletes at least one triangle. Specifically, a make…

We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic…

This paper investigates the Gaussian quasi-likelihood estimation of an exponentially ergodic multidimensional Markov process, which is expressed as a solution to a L\'{e}vy driven stochastic differential equation whose coefficients are…

We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…

Studying the subexponential convergence towards equilibrium of a strong Markov process, we exhibit an intermediate Lyapunov condition equivalent to the control of some moment of a hitting time. This provides a link, similar (although more…

The Kolmogorov-Feller equation for the probability density of a Markov process on a half-axis, which arises in important problems of biology, is considered. This process consists of random jumps distributed according to Laplace's law and a…

In this paper, the weak convergence of impulsive recurrent process with Markov switching in the scheme of Levy approximation is proved. For the relative compactness, a method proposed by R. Liptser for semimartingales is used with a…

We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…

We show that for a general Markov generator the associated square-field (or carr\'e du champs) operator and all their iterations are positive. The proof is based on an interpolation between the operators involving the generator and their…

We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…

At sufficiently high chemical potential massive relativistic spin one fields condense. This phenomenon leads to the spontaneous breaking of rotational invariance while linking it to the breaking of internal symmetries. We study the relevant…

We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).…

This paper studies a large number of homogeneous Markov decision processes where the transition probabilities and costs are coupled in the empirical distribution of states (also called mean-field). The state of each process is not known to…

A novel class of non-reversible Markov chain Monte Carlo schemes relying on continuous-time piecewise-deterministic Markov Processes has recently emerged. In these algorithms, the state of the Markov process evolves according to a…

We derive a Poisson random field model for population site polymorphisms differences within and between two species that share a relatively recent common ancestor. The model can be either equilibrium or time inhomogeneous. We first consider…

Developing satisfactory methodology for the analysis of Markov random field is a very challenging task. Indeed, due to the Markovian dependence structure, the normalizing constant of the fields cannot be computed using standard analytical…

Sample-efficient generalisation of reinforcement learning approaches have always been a challenge, especially, for complex scenes with many components. In this work, we introduce Plug and Play Markov Decision Processes, an object-based…