Related papers: Matern Cluster Process with Holes at the Cluster C…
The multifractal critical phase (MCP) fundamentally differs from extended and localized phases, exhibiting delocalized distributions in both position and momentum spaces. The investigation on the MCP has largely focused on one-dimensional…
This article introduces a novel, geometric approach for multi-manifold clustering (MMC), i.e. for clustering a collection of potentially intersecting, d-dimensional manifolds into the individual manifold components. We first compute a…
In this letter, we derive new lower bounds on the cumulative distribution function (CDF) of the contact distance in the Poisson Hole Process (PHP) for two cases: (i) reference point is selected uniformly at random from $\mathbb{R}^2$…
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalable, meaning that the local memory in each machine may be…
We present a novel approach for finding and evaluating structural models of small metallic nanoparticles. Rather than fitting a single model with many degrees of freedom, the approach algorithmically builds libraries of nanoparticle…
Given a metric space, the $(k,z)$-clustering problem consists of finding $k$ centers such that the sum of the of distances raised to the power $z$ of every point to its closest center is minimized. This encapsulates the famous $k$-median…
In a previous paper we introduced a new method for simulating collisional gravitational $N$-body systems with linear time scaling on $N$, based on the Multi-Particle Collision (MPC) approach. This allows us to simulate globular clusters…
There is a very rich literature proposing Bayesian approaches for clustering starting with a prior probability distribution on partitions. Most approaches assume exchangeability, leading to simple representations in terms of Exchangeable…
We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clusetring problem, given a set P of points in R^d, an integer k, and a non-negative real r, our…
Clustering aims to group unlabelled samples based on their similarities. It has become a significant tool for the analysis of high-dimensional data. However, most of the clustering methods merely generate pseudo labels and thus are unable…
We explore the geometrical interpretation of the PCA based clustering algorithm Principal Direction Divisive Partitioning (PDDP). We give several examples where this algorithm breaks down, and suggest a new method, gap partitioning, which…
We investigate particle condensation in a driven pair exclusion process on one- and two- dimensional lattices under the periodic boundary condition. The model describes a biased hopping of particles subject to a pair exclusion constraint…
The problem of orbital relaxation in computational core-hole spectroscopies, including x-ray absorption and x-ray photoionization, has long plagued linear response approaches, including equation-of-motion coupled cluster with singles and…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
We propose a novel set of Poisson Cluster Process (PCP) models to detect Ultra-Diffuse Galaxies (UDGs), a class of extremely faint, enigmatic galaxies of substantial interest in modern astrophysics. We model the unobserved UDG locations as…
A recently formulated description of homogeneous nucleation for Brownian particles in the over-damped limit based on fluctuating hydrodynamics is used to determine the nucleation pathway, characterized as the most likely path (MLP), for the…
With the booming development of data science, many clustering methods have been proposed. All clustering methods have inherent merits and deficiencies. Therefore, they are only capable of clustering some specific types of data robustly. In…
Model-based clustering is widely-used in a variety of application areas. However, fundamental concerns remain about robustness. In particular, results can be sensitive to the choice of kernel representing the within-cluster data density.…
The probability distribution $\mu_{cl}$ of a general cluster point process in a Riemannian manifold $X$ (with independent random clusters attached to points of a configuration with distribution $\mu$) is studied via the projection of an…
A new method that accurately describes strongly correlated states and captures dynamical correlation is presented. It is derived as a modification of coupled-cluster theory with single and double excitations (CCSD) through consideration of…