SPADE: Sequential-clustering Particle Annihilation via Discrepancy Estimation

From MaRDI portal
Publication:6340455

arXiv2005.05129MaRDI QIDQ6340455FDOQ6340455


Authors: Sihong Shao, Yunfeng Xiong Edit this on Wikidata


Publication date: 11 May 2020

Abstract: For an empirical signed measure mu=frac1Nleft(sumi=1Pdeltaxisumi=1Mdeltayiight), particle annihilation (PA) removes NA particles from both xii=1P and yii=1M simultaneously, yielding another empirical signed measure u such that intfdu approximates to intfdmu within an acceptable accuracy for suitable test functions f. Such annihilation of particles carrying opposite importance weights has been extensively utilized for alleviating the numerical sign problem in particle simulations. In this paper, we propose an algorithm for PA in high-dimensional Euclidean space based on hybrid of clustering and matching, dubbed the Sequential-clustering Particle Annihilation via Discrepancy Estimation (SPADE). It consists of two steps: Adaptive clustering of particles via controlling their number-theoretic discrepancies, and independent random matching among positive and negative particles in each cluster. Both deterministic error bounds by the Koksma-Hlawka inequality and non-asymptotic random error bounds by concentration inequalities are proved to be affected by two factors. One factor measures the irregularity of point distributions and reflects their discrete nature. The other relies on the variation of test function and is influenced by the continuity. Only the latter implicitly depends on dimensionality d, implying that SPADE can be immune to the curse of dimensionality for a wide class of test functions. Numerical experiments up to d=1080 validate our theoretical discoveries.













This page was built for publication: SPADE: Sequential-clustering Particle Annihilation via Discrepancy Estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340455)