Related papers: Replica solution of the Random Energy Model
We present a general formalism to make the Replica-Symmetric and Replica-Symmetry-Breaking ansatz in the context of Kikuchi's Cluster Variational Method (CVM). Using replicas and the message-passing formulation of CVM we obtain a…
We extract values for the free symmetry energy as a function of the fragment size (the proton number Z) from antisymmetrized molecular dynamics (AMD) calculations of calcium collisions. Simple statistical physics describe well the…
We discuss multi-dimensional generalizations of multicanonical algorithm, simulated tempering, and replica-exchange method. We generalize the original potential energy function $E_0$ by adding any physical quantity $V$ of interest as a new…
We consider a one-dimensional "gas" of inelastically colliding particles where kinetic energy is dissipated by the excitation of vibrational degrees of freedom. In our model the coefficient of restitution is a stochastic quantity whose…
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…
We present a variational quantum algorithm for structural mechanical problems, specifically addressing crack opening simulations that traditionally require extensive computational resources. Our approach provides an alternative solution for…
The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated reassemblage of finite element matrices for nonlinear PDEs is…
The numerical renormalization group (NRG) is rephrased as a variational method with the cost function given by the sum of all the energies of the effective low-energy Hamiltonian. This allows to systematically improve the spectrum obtained…
We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…
The rovibrational kinetic energy for an arbitrary number of rigid molecules is computed. The result has the same general form as the kinetic energy in the molecular rovibrational Hamiltonian, although certain quantities are augmented to…
In complex systems with many degrees of freedom such as peptides and proteins there exist a huge number of local-minimum-energy states. Conventional simulations in the canonical ensemble are of little use, because they tend to get trapped…
The random-phase approximation (RPA) as an approach for computing the electronic correlation energy is reviewed. After a brief account of its basic concept and historical development, the paper is devoted to the theoretical formulations of…
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the…
A simple method has been introduced to furnish the equilibrium solution of the Wigner equation for all order of the quantum correction. This process builds up a recursion relation involving the coefficients of the different power of the…
In this work, I propose a statistical mechanical framework, for the evaluation of the free energy in molecular systems, by "deleting" all the molecules in a "single" step. The approach can be considered as the statistical mechanics…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for…
We demonstrate that certain class of infinite sums can be calculated analytically starting from a specific quantum mechanical problem and using principles of quantum mechanics. For simplicity we illustrate the method by exploring the…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…