相关论文: Standardness of monotonic Markov filtrations

The notion of a homogeneous standard filtration of $\sigma$-algebras was introduced by the author in 1970. The main theorem asserted that a homogeneous filtration is standard, i.e., generated by a sequence of independent random variables,…

We study the standard property of the natural filtration associated to a 0--1 valued stationary process. In our main result we show that if the process has summable memory decay, then the associated filtration is standard. We prove it by…

Under multiplicative drift and other regularity conditions, it is established that the asymptotic variance associated with a particle filter approximation of the prediction filter is bounded uniformly in time, and the nonasymptotic,…

M. Smorodinsky and S. Laurent have initiated the study of the filtrations of split-word processes, in the framework of discrete negative time. For these filtrations, we show that Laurent's sufficient condition for non standardness is also…

Matrix norms can be used to measure the "distance" between two matrices which translates naturally to the problem of calculating the unitary deviation of the neutrino mixing matrices. Variety of matrix norms opens a possibility to measure…

Under continuity and recurrence assumptions, we prove that the iteration of successive partial symmetrizations that form a time-homogeneous Markov process, converges to a symmetrization. We cover several settings, including the…

By making use of martingale representations, we derive the asymptotic normality of particle filters in hidden Markov models and a relatively simple formula for their asymptotic variances. Although repeated resamplings result in complicated…

We obtain necessary and sufficient conditions for the regular variation of the variance of partial sums of functionals of discrete and continuous-time stationary Markov processes with normal transition operators. We also construct a class…

Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…

This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct - only using the graph structure of the Markov chain and…

We formalize and analyze the notions of stochastic monotonicity and realizable mono-tonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions…

Consider a filtering process associated to a hidden Markov model with densities for which both the state space and the observation space are complete, separable, metric spaces. If the underlying, hidden Markov chain is strongly ergodic and…

Filtering and smoothing with a generalised representation of uncertainty is considered. Here, uncertainty is represented using a class of outer measures. It is shown how this representation of uncertainty can be propagated using…

We prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process…

A. Vershik discovered that filtrations indexed by the non-positive integers may have a paradoxical asymptotic behaviour near the time $-\infty$, called non-standardness. For example, two dyadic filtrations with trivial tail $\sigma$-field…

Filtering is concerned with the sequential estimation of the state, and uncertainties, of a Markovian system, given noisy observations. It is particularly difficult to achieve accurate filtering in complex dynamical systems, such as those…

Methods of determination of constants of the Standard Model are considered. The constants values obtained now are presented and experiments for improving some values are pointed out. A few possible generalized models are considered together…

We present an approach for testing for the existence of continuous generators of discrete stochastic transition matrices. Typically, the known approaches to ascertain the existence of continuous Markov processes are based in the assumption…

We study stochastic monotonicity and propagation of order for Markov processes with respect to stochastic integral orders characterized by cones of functions satisfying $\Phi f \geq 0$ for some linear operator $\Phi$. We introduce a new…

A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…