<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05564764</id>
  <dt>j</dt>
  <an>05564764</an>
  <augroup>
    <au>Medvedev, I.N.</au>
    <au>Mikhailov, G.A.</au>
  </augroup>
  <ti>Recurrent partial averaging in the theory of weighted Monte Carlo methods.</ti>
  <so>Russ. J. Numer. Anal. Math. Model. 24, No. 3, 261-277 (2009).</so>
  <py>2009</py>
  <pu>Walter de Gruyter, Berlin</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Markov chain Monte Carlo method</ut>
    <ut>collision integral equation</ut>
    <ut>random Neumann series</ut>
    <ut>randomized algoritms</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1515/RJNAMM.2009.016</li>
  </ligroup>
  <abgroup>
    <ab>This paper is a continuation of a series of papers of one or both of the author's, which focus on dealing with the value of collision of the collision integral equation $$\phi(x)^*=\int_Xk(x,x')\phi(x')^*dx'+h(x)$$ by using the Markov chain Monte Carlo method. Let $\{x_n\}$ be a Markov chain breaking with probability one with transition density $p(x,x')$. A random Neumann series is formulated by using the ratio $q(x,x')=\frac{k(x,x')}{p(x,x')}$ and then, through a recurrent representation, a random series $\{\xi_x{}_n{}\}$, of which the expection (if bounded) provides the solution of the collision integral equation. Along this topic, some randomized algoritms with different branching mechanics are also suggested in this paper to achieve the finite variance to ensure the boundness of the expection.</ab>
    <rv>Gong Guanglu (Beijing)</rv>
  </abgroup>
</item>