Related papers: Stitching pairs of Levy processes into harnesses
A multiplicative cascade can be thought of as a randomization of a measure on the boundary of a tree, constructed from an iid collection of random variables attached to the tree vertices. Given an initial measure with certain regularity…
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…
A universal method for the concatenation of a sequence of Markov right processes is established. It is then applied to the continued pasting of two Markov right processes, which can be used for pathwise constructions of locally defined…
A Markov Additive Process is a bi-variate Markov process $(\xi,J)=\big((\xi_t,J_t),t\geq0\big)$ which should be thought of as a multi-type L\'evy process: the second component $J$ is a Markov chain on a finite space $\{1,\ldots,K\}$, and…
We present a satisfactory definition of the important class of L\'evy processes indexed by a general collection of sets. We use a new definition for increment stationarity of set-indexed processes to obtain different characterizations of…
In the paper we consider some piecewise deterministic Markov process whose continuous component evolves according to semiflows, which are switched at the jump times of a Poisson process. The associated Markov chain describes the states of…
We characterise the convergence of a certain class of discrete time Markov processes toward locally Feller processes in terms of convergence of associated operators. The theory of locally Feller processes is applied to L\'evy-type processes…
The running infimum of a Levy process relative to its point of issue is know to have the same range that of the negative of a certain subordinator. Conditioning a Levy process issued from a strictly positive value to stay positive may…
Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…
We discuss an impact of various (path-wise) reflection-from-the barrier scenarios upon confining properties of a paradigmatic family of symmetric $\alpha $-stable L\'{e}vy processes, whose permanent residence in a finite interval on a line…
We describe a system that lets a designer interactively draw patterns of strokes in the picture plane, then guide the synthesis of similar patterns over new picture regions. Synthesis is based on an initial user-assisted analysis phase in…
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…
We provide asymptotic results and develop high frequency statistical procedures for time-changed L\'evy processes sampled at random instants. The sampling times are given by first hitting times of symmetric barriers whose distance with…
We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the…
In this paper our first goal is to give precise definition of the L\'evy bridges with random length. Our second task is to establish the Markov property of this process with respect to its completed natural filtration and thus with respect…
The "necklace process", a procedure constructing necklaces of black and white beads by randomly choosing positions to insert new beads (whose color is uniquely determined based on the chosen location), is revisited. This article illustrates…
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…
We construct a family of self-similar Markov martingales with given marginal distributions. This construction uses the self-similarity and Markov property of a reference process to produce a family of Markov processes that possess the same…
Interweaving relations are introduced and studied here in a general Markovian setting as a strengthening of usual intertwining relations between semigroups, obtained by adding a randomized delay feature. They provide a new classification…
This paper introduces Switching Processes, called SP. Their constructions are inspired by the PDMP's ones (PDMP stands for Piecewise Deterministic Markov Process). A Markov process, called the intrinsic process, replaces the PDMP's flow.…