IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v30y2024i2p107-129n1001.html
   My bibliography  Save this article

A weight Monte Carlo estimation of fluctuations in branching processes

Author

Listed:
  • Uchaikin Vladimir

    (Department of Theoretical Physics, Ulyanovsk State University, L. Tolstoy str. 42, 432017 Ulyanovsk, Russia)

  • Kozhemiakina Elena

    (Department of Theoretical Physics, Ulyanovsk State University, L. Tolstoy str. 42, 432017 Ulyanovsk, Russia)

Abstract

It is well known that shortened modeling of particle trajectories with the use multiplicative statistical weights, as a rule, increases the efficiency of the program (in terms of accuracy/time ratio). This trick is often used in non-branching schemes simulating transfer processes without multiplication (for example, the transfer of X-ray radiation), in which it is sufficient to confine ourselves to studying only the average values of the field characteristics. With an increase in energy, however, multiplication processes begin to play a significant role (the production of electron-photon pairs by gamma quanta with energies above 1.022 MeV, etc.), when the resulting trajectory is not just a broken curve in the phase space, but a branched tree. This technique is also applicable to this process, but only if the study of statistical fluctuations and correlations is not the purpose of the calculation. The present review contains the basic concepts of the Monte Carlo method as applied to the theory of particle transport, demonstration of the weighting method in non-branching processes, and ends with a discussion of unbiased estimates of the second moment and covariance of additive functionals.

Suggested Citation

  • Uchaikin Vladimir & Kozhemiakina Elena, 2024. "A weight Monte Carlo estimation of fluctuations in branching processes," Monte Carlo Methods and Applications, De Gruyter, vol. 30(2), pages 107-129.
  • Handle: RePEc:bpj:mcmeap:v:30:y:2024:i:2:p:107-129:n:1001
    DOI: 10.1515/mcma-2023-2015
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2023-2015
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/mcma-2023-2015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:mcmeap:v:30:y:2024:i:2:p:107-129:n:1001. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.