Related papers: A Partition Function Estimator
A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…
Estimation and inference with modern longitudinal data from wearable devices, which consist of biological signals at high-frequency time points, is burdened by massive computational costs. We propose a distributed estimation and inference…
Composition methodologies in the current literature are mainly to promote estimation efficiency via direct composition, either, of initial estimators or of objective functions. In this paper, composite estimation is investigated for both…
In this paper we propose a novel partition-based distributed state estimation scheme for non-overlapping subsystems based on Kalman filter. The estimation scheme is designed in order to account, in a rigorous fashion, for dynamic coupling…
The recently introduced nested sampling algorithm allows the direct and efficient calculation of the partition function of atomistic systems. We demonstrate its applicability to condensed phase systems with periodic boundary conditions by…
We introduce the Poisson tensor completion (PTC) estimator that exploits inter-sample relationships to compute a low-rank Poisson tensor decomposition of the frequency histogram for samples of a multivariate distribution. Our crucial…
We discuss an exact analytical solution of a simplified version of the statistical multifragmentation model with the restriction that the largest fragment size cannot exceed the finite volume of the system. A complete analysis of the…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…
Estimating the number of components is a fundamental challenge in unsupervised learning, particularly when dealing with high-dimensional data with many components or severely imbalanced component sizes. This paper addresses this challenge…
We propose an efficient algorithm for estimation of possibility based qualitative expected utility. It is useful for decision making mechanisms where each possible decision is assigned a multi-attribute possibility distribution. The…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
This paper considers the arbitrary-proportional finite-set-partitioning problem which involves partitioning a finite set into multiple subsets with respect to arbitrary nonnegative proportions. This is the core art of many fundamental…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
Partition density functional theory is a formally exact procedure for calculating molecular properties from Kohn-Sham calculations on isolated fragments, interacting via a global partition potential that is a functional of the fragment…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In…
Theoretical estimates for the cutoff errors in the Ewald summation method for dipolar systems are derived. Absolute errors in the total energy, forces and torques, both for the real and reciprocal space parts, are considered. The…
We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…
We have done a study of the zero-dimensional $\lambda\phi^{4}$ model. Firstly, we exhibit the partition function as a simple exact expression in terms of the Macdonald's function for $Re(\lambda)>0$. Secondly, an analytic continuation of…
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…