Partitioning Composite Finite Systems
A. S. Botvina (1,2,3), A. D. Jackson (4), and I.N. Mishustin (4,5,6), ((1) GANIL Caen, France, (2) INFN Bologna, Italy, (3) INR Moscow, Russia, (4), NBI Copenhagen, Denmark, (5) Kurchatov Institute Moscow, Russia, (6) ITP, Frankfurt/M University, Germany)
TL;DR
This paper introduces a new numerical method using Markov chains and the Metropolis algorithm to analyze the partitioning of finite systems, demonstrating advantages over existing methods especially with complex weights.
Contribution
A novel numerical approach for exploring partition spaces of finite systems using Markov chains and the Metropolis algorithm, improving sampling efficiency.
Findings
Effective exploration of partition space demonstrated
Advantages shown for sampling with non-trivial weights
Method outperforms traditional approaches in specific scenarios
Abstract
We compare different analytical and numerical methods for studying the partitions of a finite system into fragments. We propose a new numerical method of exploring the partition space by generating the Markov chains of partitions based on the Metropolis algorithm. The advantages of the new method for the problems where partitions are sampled with non-trivial weights are demonstrated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.