Related papers: Rejection-free cluster Wang-Landau algorithm for h…
In this paper we explore the use of spatial clustering algorithms as a new computational approach for modeling the cosmic web. We demonstrate that such algorithms are efficient in terms of computing time needed. We explore three distinct…
A previously derived three-dimensional effective lattice theory describing the thermodynamics of QCD with heavy quarks in the cold and dense region is extended through order $\sim u^5\kappa^8$ in the combined character and hopping expansion…
We demonstrate the accuracy of the hypernetted chain closure and of the mean-field approximation for the calculation of the fluid-state properties of systems interacting by means of bounded and positive-definite pair potentials with…
We report a new multicanonical Monte Carlo algorithm to obtain the density of states for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain a closed-form expression for the density of…
In the context of Monte Carlo sampling for lattice models, the complexity of the energy landscape often leads to Markov chains being trapped in local optima, thereby increasing the correlation between samples and reducing sampling…
We show that Wang-Landau sampling, combined with suitable Monte Carlo trial moves, provides a powerful method for both the ground state search and the determination of the density of states for the hydrophobic-polar (HP) protein model and…
Especially in lattice structured populations, homogeneous mixing represents an inadequate assumption. Various improvements upon the ordinary pair approximation based on a number of assumptions concerning the higher-order correlations have…
A simple lattice model is used to study compaction in granular media. As in real experiments, we consider a series of taps separated by large enough waiting times. The relaxation of the density exhibits the characteristic inverse…
The community detection problem for graphs asks one to partition the n vertices V of a graph G into k communities, or clusters, such that there are many intracluster edges and few intercluster edges. Of course this is equivalent to finding…
The emergence of scanning probe and electron beam imaging techniques have allowed quantitative studies of atomic structure and minute details of electronic and vibrational structure on the level of individual atomic units. These microscopic…
Powder auto-indexing is the crystallographic problem of lattice determination from an average theta series. There, in addition to all the multiplicities, the lengths of part of lattice vectors cannot be obtained owing to systematic…
Discrete Gaussian Sampling on lattices is a fundamental problem in lattice-based cryptography. It appears both in basic cryptographic primitives such as digital signatures and as an important cryptanalysis building block for solving hard…
Algorithms based on the particle flow approach are becoming increasingly utilized in collider experiments due to their superior jet energy and missing energy resolution compared to the traditional calorimeter-based measurements. Such…
Currently, density-based clustering algorithms are widely applied because they can detect clusters with arbitrary shapes. However, they perform poorly in measuring global density, determining reasonable cluster centers or structures,…
Given a structure made up of n sites connected by b bars, the problem of recognizing which subsets of sites form rigid units is not a trivial one, because of the non-local character of rigidity in central-force systems. Even though this is…
It is interesting to study the stress concentration between two adjacent stiff inclusions in composite materials, which can be modeled by the Lam\'e system with partially infinite coefficients. To overcome the difficulty from the lack of…
We propose a pair of completely data-driven algorithms for unsupervised classification and dimension reduction, and we empirically study their performance on a number of data sets, both simulated data in three-dimensions and images from the…
To our best knowledge there is only one example of a lattice system with long-range two-body interactions whose ground states have been determined exactly: the one-dimensional lattice gas with purely repulsive and strictly convex…
A simple lattice gas model in one dimension is constructed in which each site can be occupied by at most one particle of any one of $D$ species. Particles interact with a randomly drawn nearest neighbor interaction. This model is capable of…
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…