相关论文: CaSPA - an Algorithm for Calculation of the Size o…
A variant of the Direct Simulation Monte Carlo method is used to study the behavior of a granular gas, in two and three dimensions, under varying density, restitution coefficient, and inelasticity regimes, for realistic vibrating wall…
This paper deals with nonparametric estimation of conditional den-sities in mixture models in the case when additional covariates are available. The proposed approach consists of performing a prelim-inary clustering algorithm on the…
Clustering algorithms build jets though the iterative application of single particle and pairwise metrics. This leads to phase space constraints that are extremely complicated beyond the lowest orders in perturbation theory, and in practice…
This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems. The study begins with an in-depth analysis of the pSA…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and…
The charge on an aggregate immersed in a plasma environment distributes itself over the aggregate's surface; this can be approximated theoretically by assuming a multipole distribution. The dipole-dipole (or higher order) charge…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) computationally…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
While several papers have investigated computationally and statistically efficient methods for learning Gaussian mixtures, precise minimax bounds for their statistical performance as well as fundamental limits in high-dimensional settings…
By imposing twisted boundary conditions on quark fields it is possible to access components of momenta other than integer multiples of 2pi/L on a lattice with spatial volume L^3. We use Chiral Perturbation Theory to study finite-volume…
This paper discusses a deterministic clustering approach to capacitated resource allocation problems. In particular, the Deterministic Annealing (DA) algorithm from the data-compression literature, which bears a distinct analogy to the…
We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from high-dimensional, multi-indexed datasets. This framework is designed to enable detection of clusters of data in the presence of structural…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
The paper presents the algorithm for clustering a dataset by grouping the optimal, from the point of view of the BIC criterion, number of Gaussian clusters into the optimal, from the point of view of their statistical separability,…
The coupled cluster iteration scheme for determining the cluster amplitudes involves a set of nonlinearly coupled difference equations. In the space spanned by the amplitudes, the set of equations are analysed as a multivariate…
This paper investigates a generation expansion planning (GEP) problem encompassing renewable, thermal, and storage technologies while simultaneously optimizing market participation, operational expenditures, and capital investment. To…
When studying a metastable dynamical system, a prime concern is how to decompose the phase space into a set of metastable states. Unfortunately, the metastable state decomposition based on simulation or experimental data is still a…
We study the convergence properties of a class of data augmentation algorithms targeting posterior distributions of Bayesian lasso models with log-concave likelihoods. Leveraging isoperimetric inequalities, we derive a generic convergence…