Papers › Exact weight cancellation in Monte Carlo eigenvalue transport problems

Exact weight cancellation in Monte Carlo eigenvalue transport problems

25 Mar 2021arXiv:2103.13891links table onlyarchive 2025-07-28

Hunter Belanger, Davide Mancusi, Andrea Zoia

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Random walks are frequently used as a model for very diverse physical phenomena. The Monte Carlo method is a versatile tool for the study of the properties of systems modelled as random walks. Often, each walker is associated with a statistical weight, used in the estimation of observable quantities. Weights are typically assumed to be positive; nonetheless, some applications require the use of positive and negative weights or complex weights, and often pose particular challenges with convergence. In this paper, we examine such a case from the field of nuclear reactor physics, where the negative particle weights prevent the power iteration algorithm from converging on the sought fundamental eigenstate of the Boltzmann transport equation. We demonstrate how the use of weight cancellation allows convergence on the physical eigenstate. To this end, we develop a novel method to perform weight cancellation in an exact manner, in three spatial dimensions. The viability of this algorithm is then demonstrated on a reactor physics problem.

PaperPDFCode

Code

HunterBelanger/mgmc officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections