Related papers: Some preliminary results on relation between tripl…
We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited…
[Abridged] We present the first determination of the intrinsic three-dimensional shapes and the physical parameters of both dark matter (DM) and intra-cluster medium (ICM) in a triaxial galaxy cluster. While most previous studies rely on…
We present a cosmography analysis of the Local Universe based on the recently released Two-Micron All-Sky Redshift Survey (2MRS). Our method is based on a Bayesian Networks Machine Learning algorithm (the Kigen-code) which self-consistently…
We study the cluster structure of $^{12}$C and $^{13}$C in the framework of the cluster shell model. Simple relations are derived for ratios of longitudinal form factors as well as transition probabilities. It is shown that the available…
We provide a cluster-algebraic approach to the computation of the recently introduced generalised biadjoint scalar amplitudes related to Grassmannians ${\rm Gr}(k,n)$. A finite cluster algebra provides a natural triangulation for the…
Fock-Goncharov's moduli spaces $\mathscr{X}_{{\rm PGL}_3,\frak{S}}$ of framed ${\rm PGL}_3$-local systems on punctured surfaces $\frak{S}$ provide prominent examples of cluster $\mathscr{X}$-varieties and higher Teichm\"uller spaces. In a…
We report on our search for distant clusters of galaxies based on optical and X-ray follow up observations of X-ray candidates from the SHARC survey. Based on the assumption that the absence of bright optical or radio counterparts to…
A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…
We study supervised learning problems using clustering constraints to impose structure on either features or samples, seeking to help both prediction and interpretation. The problem of clustering features arises naturally in text…
The Large-Scale Structure (LSS) of the Universe is a homogeneous network of galaxies separated in dense complexes, the superclusters of galaxies, and almost empty voids. The superclusters are young structures that did not have time to…
In this work, we develop a general method for estimating the Shannon entropy of a bidimensional sequence based on the extrapolation of block entropies. We apply this method to analyse the spatial configurations of cities of different…
Galaxy clusters are the products of structure formation through myriad physical processes that affect their growth and evolution throughout cosmic history. As a result, the matter distribution within galaxy clusters, or their shape, is…
Previous studies of the galaxy and galaxy cluster distribution in the local Universe found indications for a large extension of the Local Supercluster up to a radius of 190 h_70^-1 Mpc. We are using our large and highly complete CLASSIX…
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…
A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random…
Coding information is the main source of heterogeneity (non-randomness) in the sequences of bacterial genomes. This information can be naturally modeled by analysing cluster structures in the "in-phase" triplet distributions of relatively…
The statistical measure of spatial inhomogeneity for n points placed in chi cells each of size kxk is generalized to incorporate finite size objects like black pixels for binary patterns of size LxL. As a function of length scale k, the…
Several methods for triclustering three-dimensional data require the cluster size or the number of clusters in each dimension to be specified. To address this issue, the Multi-Slice Clustering (MSC) for 3-order tensor finds signal slices…
We develop a machine learning algorithm to infer the 3D cumulative radial profiles of total and gas mass in galaxy clusters from thermal Sunyaev-Zel'dovich effect maps. We generate around 73,000 mock images along various lines of sight…
We consider a novel clustering task in which clusters can have compositional relationships, e.g., one cluster contains images of rectangles, one contains images of circles, and a third (compositional) cluster contains images with both…