Partitioning Composite Finite Systems
A. S. Botvina, A. D. Jackson, I. N. Mishustin
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.
Create a lesson
Related papers
2-Morita Theory of E2-Algebras and Module Categories
Rongge Xu, Holiverse Yang
Multiscale Loop Vertex Expansion for Cumulants, the ϕ42 Model
Vincent Rivasseau
Quasi-polynomiality and N-point functions of single connected leaky completed Hurwitz numbers
Chongyu Wang, Chenglang Yang
Coupled stochastic variational principles for multiscale surface gravity waves -- Part I: theoretical framework
Etienne Mémin, Arnaud Debussche
The Sharp Spectral Transition for Almost Mathieu Operators via Alternating Resonances
Jiawei He, Xueyin Wang
Dynamical classical-field limit of Bosonic Gibbs states: Renormalized Hartree NLS correlations in 2D and 3D
Phan Thành Nam, Rongchan Zhu, Xiangchan Zhu