The three-dimensional high-order simulation algorithm HOSIM is developed to simulate complex nonlinear and non-Gaussian systems. HOSIM is an alternative to the current MP approaches and it is based upon new high-order spatial connectivity measures, termed high-order spatial cumulants. The HOSIM algorithm implements a sequential simulation process, where local conditional distributions are gener...

In this report we address the problem of nonlinear filtering in the presence of integer uncertainty. In the simulation results we show that particle filtering is capable of resolving integer ambiguity in the given nonlinear setup. Motivated by these results we introduce particle filtering for an exponential family of densities. We prove that under certain conditions the approximated conditional...

we prove that the limit of a sequence of pettis integrable bounded scalarly measurable weak random elements, of finite weak norm, with values in the dual of a non-separable banach space is pettis integrable. then we provide basic properties for the pettis conditional expectation, and prove that it is continuous. calculus of pettis conditional expectations in general is very different from the c...

researchers of language teaching believe that teaching method has a lot of impact on the speed and depth of learning. the importance of this is so obvious on teaching some persian language structures which are syntactically and semantically complicated. one of these structures is conditional sentences which has been considered in this study. here we tried to teach conditional sentences via both...

0

This article concerns a perfect simulation algorithm for unmarked and marked Hawkes processes. The usual straightforward simulation algorithm suffers from edge effects, whereas our perfect simulation algorithm does not. By viewing Hawkes processes as Poisson cluster processes and using their branching and conditional independence structure, useful approximations of the distribution function for...

This article concerns a perfect simulation algorithm for unmarked and marked Hawkes processes. The usual straightforward simulation algorithm suffers from edge effects, whereas our perfect simulation algorithm does not. By viewing Hawkes processes as Poisson cluster processes and using their branching and conditional independence structure, useful approximations of the distribution function for...

We establish conditions under which Metropolis-Hastings (MH) algorithms with a position-dependent proposal covariance matrix will or not have the geometric rate of convergence. Some diffusions based MH like Metropolis adjusted Langevin algorithm (MALA) and pre-conditioned MALA (PCMALA) position-independent variance. Whereas, for other modern variants manifold (MMALA) that adapt to geometry targ...