相关论文: Weak Separation, Pure Domains and Cluster Distance
A collection $\mathcal{C}$ of $k$-element subsets of $\{1,2,\ldots,m\}$ is weakly separated if for each $I, J \in \mathcal{C}$, when the integers $1,2,\ldots,m$ are arranged around in a circle, there is a chord separating $I \backslash J$…
We present a short proof that every maximal family of weakly separated subsets of $[n]$ of cardinality between $[a,b]$ have the same size. Our proof is direct and only uses elementary combinatorics of lattice paths.
A compact metric space $(X, \rho)$ is given. Let $\mu$ be a Borel measure on $X$. By $r$-cluster we mean a measurable subset of $X$ with diameter at most $r$. A family of $k$ $2r$-clusters is called a $r$-cluster structure of order $k$ if…
Let $n$ be a positive integer. A collection $\cal S$ of subsets of $[n]=\{1,\ldots,n\}$ is called {\it symmetric} if $X\in {\cal S}$ implies $X^\ast\in {\cal S}$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$. We show that in each of the…
In the context of clustering, we consider a generative model in a Euclidean ambient space with clusters of different shapes, dimensions, sizes and densities. In an asymptotic setting where the number of points becomes large, we obtain…
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal by inclusion weakly separated collections of minors have the…
A compact metric space $(X, \rho)$ is given. Let $\mu$ be a Borel measure on $X$. By $r$-cluster we mean a measurable subset of $X$ with diameter at most $r$. A family of $k$ $2r$-clusters is called a $r$-cluster structure of order $k$ if…
We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we…
The amplitude of weak lensing should increase with source distance, rising steeply behind a lens and saturating at high redshift, providing a model-independent means of measuring cosmic geometry. We measure the amplitude of weak lensing…
We study the clustering problem for mixtures of bounded covariance distributions, under a fine-grained separation assumption. Specifically, given samples from a $k$-component mixture distribution $D = \sum_{i =1}^k w_i P_i$, where each $w_i…
We present an efficient and robust approach for extracting clusters of galaxies from weak lensing survey data and measuring their properties. We use simple, physically-motivated cluster models appropriate for such sparse, noisy data, and…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
Clustering under pairwise constraints is an important knowledge discovery tool that enables the learning of appropriate kernels or distance metrics to improve clustering performance. These pairwise constraints, which come in the form of…
In the 1960s Moser asked how dense a subset of $\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense…
An appropriate distance metric is crucial for categorical data clustering, as the distance between categorical data cannot be directly calculated. However, the distances between attribute values usually vary in different clusters induced by…
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…
Cluster validity indexes are very important tools designed for two purposes: comparing the performance of clustering algorithms and determining the number of clusters that best fits the data. These indexes are in general constructed by…
For an odd integer $r>0$ and an integer $n>r$, we introduce a notion of weakly $r$-separated collections of subsets of $[n]=\{1,2,\ldots,n\}$. When $r=1$, this corresponds to the concept of weak separation introduced by Leclerc and…
The Bullet Cluster (1E 0657-56) is a key astrophysical laboratory for studying dark matter, galaxy cluster mergers, and shock propagation in extreme environments. Using new JWST imaging, we present the highest-resolution mass reconstruction…
We use the abundance and weak lensing mass measurements of the SDSS maxBCG cluster catalog to simultaneously constrain cosmology and the richness--mass relation of the clusters. Assuming a flat \LambdaCDM cosmology, we find…