The basic reconstruction problem lead with the general task of retrieving a scenery from observations made by a random walker. A critical factor associated with the problem is reconstructing the scenery in polynomial time. In this article, we propose a novel technique based on the modern DNA...

In this paper, we define and study a new class of random fields called harmonizable multi-operator scaling stable random fields. These fields satisfy a local asymptotic operator scaling property which generalizes both the local asymptotic self-similarity property and the operator scaling...

We exhibit a Probabilistic Cellular Automaton (PCA) on { 0 , 1 } Z with a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether uniqueness of the invariant measure implies ergodicity for a PCA.

The monotone rearrangement of a function is the non-decreasing function with the same distribution. The convex rearrangement of a smooth function is obtained by integrating the monotone rearrangement of its derivative. This operator can be applied to regularizations of a stochastic process to...

Context tree models have been introduced by Rissanen in [25] as a parsimonious generalization of Markov models. Since then, they have been widely used in applied probability and statistics. The present paper investigates non-asymptotic properties of two popular procedures of context tree...

Let ξ(t) be a standard stationary Gaussian process with covariance function r(t), and η(t), another smooth random process. We consider the probabilities of exceedances of ξ(t)η(t) above a high level u occurring in an interval [0,T] with T0. We present asymptotically exact results for...

A financial market model where agents trade using realistic combinations of simple (i.e., finite combinations of buy-and-hold) no-short-sales strategies is considered. Minimal assumptions are made on the discounted asset-price process â in particular, the semimartingale property is not assumed....

Mixing time quantifies the convergence speed of a Markov chain to the stationary distribution. It is an important quantity related to the performance of MCMC sampling. It is known that the mixing time of a reversible chain can be significantly improved by lifting, resulting in an irreversible...

We propose an infinitesimal dispersion index for Markov counting processes. We show that, under standard moment existence conditions, a process is infinitesimally (over-)equi-dispersed if, and only if, it is simple (compound), i.e. it increases in jumps of one (or more) unit(s), even though...

In this paper, we compute the Laplace transform of occupation times (of the negative half-line) of spectrally negative Lévy processes. Our results are extensions of known results for standard Brownian motion and jump-diffusion processes. The results are expressed in terms of the so-called scale...