Related papers: Testing Lennard-Jones Clusters for Optimality
One of the main challenges in data mining is choosing the optimal number of clusters without prior information. Notably, existing methods are usually in the philosophy of cluster validation and hence have underlying assumptions on data…
Given a weighted and complete graph G = (V, E), V denotes the set of n objects to be clustered, and the weight d(u, v) associated with an edge (u, v) belonging to E denotes the dissimilarity between objects u and v. The diameter of a…
Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters,…
Regional data center clusters have flourished in recent years to serve customers in a major city with low latency. The optimal coordination of data centers in a regional cluster has become a pressing issue because of its rising energy…
The coherent potential approximation, CPA, is a useful tool to treat systems with disorder. Cluster theories have been proposed to go beyond the translation invariant single-site CPA approximation and include some short range correlations.…
The design of accurate helium-solute interaction potentials for the simulation of chemically complex molecules solvated in superfluid helium has long been a cumbersome task due to the rather weak but strongly anisotropic nature of the…
Leptonic \textit{CP} violation search, neutrino mass hierarchy determination, and the precision measurement of oscillation parameters for a unitary test of the leptonic mixing matrix are among the major targets of the ongoing and future…
Molecular dynamics simulations are used to generate an ensemble of saddles of the potential energy of a Lennard-Jones liquid. Classifying all extrema by their potential energy u and number of unstable directions k, a well defined relation…
We consider many-to-one matching problems, where one side consists of students and the other side of schools with capacity constraints. We study how to optimally increase the capacities of the schools so as to obtain a stable and perfect…
Clustering is a widely used unsupervised learning method for finding structure in the data. However, the resulting clusters are typically presented without any guarantees on their robustness; slightly changing the used data sample or…
We consider a model for repeated stochastic matching where compatibility is probabilistic, is realized the first time agents are matched, and persists in the future. Such a model has applications in the gig economy, kidney exchange, and…
Model selection is a major challenge in non-parametric clustering. There is no universally admitted way to evaluate clustering results for the obvious reason that no ground truth is available. The difficulty to find a universal evaluation…
Clustering is a long-standing research problem and a fundamental tool in AI and data analysis. The traditional k-center problem, a fundamental theoretical challenge in clustering, has a best possible approximation ratio of 2, and any…
Two new criteria, that involve the microscopic dynamics of the system, are proposed for the identification of clusters in continuum systems. The first one considers a residence time in the definition of the bond between pairs of particles,…
This paper is the third in an investigation begun in arXiv:1906.05602 and arXiv:1907.07571 of extending the T1 theorem of David and Journ\'e, and optimal cancellation conditions, to more general weight pairs. The main result here is that…
Motivated by group-project distribution, we introduce and study stable matching under the constraint of applicants needing to share a location to be matched with the same institute, which we call the Location-Restricted Stable Matching…
Real-world networks often come with side information that can help to improve the performance of network analysis tasks such as clustering. Despite a large number of empirical and theoretical studies conducted on network clustering methods…
Suppose, we are given a set of $n$ elements to be clustered into $k$ (unknown) clusters, and an oracle/expert labeler that can interactively answer pair-wise queries of the form, "do two elements $u$ and $v$ belong to the same cluster?".…
Depositions of amorphous Lennard-Jones clusters on a crystalline surface are numerically investigated. From the results of the molecular dynamics simulation, we found that the deposited clusters exhibit a transition from multilayered…
We study the design of energy-efficient algorithms for the LOCAL and CONGEST models. Specifically, as a measure of complexity, we consider the maximum, taken over all the edges, or over all the nodes, of the number of rounds at which an…