The Monte-Carlo method for filtering with discrete-time observations: Central limit theorems

2002 ◽  
pp. 29-53 ◽  
Author(s):  
Pierre Del Moral ◽  
Jean Jacod
2013 ◽  
Vol 13 (5&6) ◽  
pp. 430-438
Author(s):  
Takuya Machida

Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence have been investigated. The relation between quantum walks and quantum probability theory is still unknown. As random walks are fundamental models in the Kolmogorov probability theory, can the quantum walks play an important role in quantum probability theory? To discuss this problem, we focus on a discrete-time 2-state quantum walk with a non-localized initial state and present a limit theorem. By using our limit theorem, we generate probability laws in the quantum central limit theorems from the quantum walk.


1999 ◽  
Vol 36 (2) ◽  
pp. 415-432 ◽  
Author(s):  
Frank Ball

In this paper, central limit theorems for multivariate semi-Markov sequences and processes are obtained, both as the number of jumps of the associated Markov chain tends to infinity and, if appropriate, as the time for which the process has been running tends to infinity. The theorems are widely applicable since many functions defined on Markov or semi-Markov processes can be analysed by exploiting appropriate embedded multivariate semi-Markov sequences. An application to a problem in ion channel modelling is described in detail. Other applications, including to multivariate stationary reward processes, counting processes associated with Markov renewal processes, the interpretation of Markov chain Monte Carlo runs and statistical inference on semi-Markov models are briefly outlined.


Author(s):  
Mikhail Chebunin ◽  
Sergei Zuyev

AbstractWe study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labeled 1,2,... so that the urn j at every draw gets a ball with probability $$p_j$$ p j , where $$\sum _j p_j=1$$ ∑ j p j = 1 . We prove functional central limit theorems for discrete time and the Poissonized version for the urn occupancies process, for the odd occupancy and for the missing mass processes extending the known non-functional central limit theorems.


1999 ◽  
Vol 36 (02) ◽  
pp. 415-432 ◽  
Author(s):  
Frank Ball

In this paper, central limit theorems for multivariate semi-Markov sequences and processes are obtained, both as the number of jumps of the associated Markov chain tends to infinity and, if appropriate, as the time for which the process has been running tends to infinity. The theorems are widely applicable since many functions defined on Markov or semi-Markov processes can be analysed by exploiting appropriate embedded multivariate semi-Markov sequences. An application to a problem in ion channel modelling is described in detail. Other applications, including to multivariate stationary reward processes, counting processes associated with Markov renewal processes, the interpretation of Markov chain Monte Carlo runs and statistical inference on semi-Markov models are briefly outlined.


2020 ◽  
Vol 2020 (4) ◽  
pp. 25-32
Author(s):  
Viktor Zheltov ◽  
Viktor Chembaev

The article has considered the calculation of the unified glare rating (UGR) based on the luminance spatial-angular distribution (LSAD). The method of local estimations of the Monte Carlo method is proposed as a method for modeling LSAD. On the basis of LSAD, it becomes possible to evaluate the quality of lighting by many criteria, including the generally accepted UGR. UGR allows preliminary assessment of the level of comfort for performing a visual task in a lighting system. A new method of "pixel-by-pixel" calculation of UGR based on LSAD is proposed.


Author(s):  
V.A. Mironov ◽  
S.A. Peretokin ◽  
K.V. Simonov

The article is a continuation of the software research to perform probabilistic seismic hazard analysis (PSHA) as one of the main stages in engineering seismic surveys. The article provides an overview of modern software for PSHA based on the Monte Carlo method, describes in detail the work of foreign programs OpenQuake Engine and EqHaz. A test calculation of seismic hazard was carried out to compare the functionality of domestic and foreign software.


Sign in / Sign up

Export Citation Format

Share Document