SearcharxivSearch

arXiv · 1503.07316

Introduction to labeled island particle models and their asymptotic properties

Abstract

Estimation of stochastic processes evolving in a random environment is of crucial importance for example to predict aircraft trajectories evolving in an unknown atmosphere. For fixed parameter, interacting particle systems are a convenient way to approximate such stochastic process. But the second level of uncertainty provided by the environment parameters leads us to also consider interacting particles on the parameter space. This novel algorithm is described in this paper. It allows to approximate both a random environment and a stochastic process evolving in this environment, given noisy observations of the process. It is a sequential algorithm that generalizes island particle models including a parameter. It is referred by us as labeled island particle algorithm. We prove the convergence of the labeled island particle algorithm and we establish $\mathbb{L}^p$ bound as well as time uniform $\mathbb{L}^p$ bound for the asymptotic error introduced by this double level of approximation. Finally, we illustrate these results on a filtering problem where one learns a dynamical parameter through noisy observations of a stochastic process influenced by the parameter.

Explore related subjects

Keep this discovery

BibTeXRIS

Cécile Ichard, Christelle Vergé. 2015-03-25. Introduction to labeled island particle models and their asymptotic properties. https://arxiv.org/abs/1503.07316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR