相关论文: Cluster adjacency beyond MHV

Associated to any acyclic cluster algebra is a corresponding triangulated category known as the cluster category. It is known that there is a one-to-one correspondence between cluster variables in the cluster algebra and exceptional…

The present study illuminates the relation between null cusped Wilson loops and their corresponding amplitudes. We find that, compared to the case with no self-crossing, the one loop expectation value of a self-intersecting Wilson loop…

Cluster interpretation after dimensionality reduction (DR) is a ubiquitous part of exploring multidimensional datasets. DR results are frequently represented by scatterplots, where spatial proximity encodes similarity among data samples. In…

We continue the study of the duality between super-correlators and scattering super-amplitudes in planar N=4 SYM. We provide a number of further examples supporting the conjectured duality relation between these two seemingly different…

In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches,…

We establish a connection between tangles, a concept from structural graph theory that plays a central role in Robertson and Seymour's graph minor project, and hierarchical clustering. Tangles cannot only be defined for graphs, but in fact…

Scatterplots are used for a variety of visual analytics tasks, including cluster identification, and the visual encodings used on a scatterplot play a deciding role on the level of visual separation of clusters. For visualization designers,…

Non-equilibrium cluster-cluster aggregation of particles diffusing in or at the cell membrane has been hypothesized to lead to domains of finite size in different biological contexts such as lipid rafts, cell adhesion complexes, or…

Bayesian hierarchical clustering (BHC) is an agglomerative clustering method, where a probabilistic model is defined and its marginal likelihoods are evaluated to decide which clusters to merge. While BHC provides a few advantages over…

We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…

We study the problem of graph clustering under a broad class of objectives in which the quality of a cluster is defined based on the ratio between the number of edges in the cluster, and the total weight of vertices in the cluster. We show…

Rephasing and non-rephasing two-dimensional coherent spectra map the anti-crossing associated with normal-mode splitting in a semiconductor microcavity. For a 12-meV detuning range near zero detuning, it is observed that there are two…

We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in…

The clustering amplitude of galaxies depends on their intrinsic luminosity. We compare the properties of publicly available galaxy formation models with clustering measurements from the two-degree field galaxy redshift survey. The model…

We consider extended starlike networks where the hub node is coupled with several chains of nodes representing star rays. Assuming that nodes of the network are occupied by nonidentical self-oscillators we study various forms of their…

We study tree-level biadjoint scalar amplitudes in the language of $D$-modules. We construct left ideals in the Weyl algebra $D$ that allow a holonomic representation of $n$-point amplitudes in terms of the linear partial differential…

Spectral clustering views the similarity matrix as a weighted graph, and partitions the data by minimizing a graph-cut loss. Since it minimizes the across-cluster similarity, there is no need to model the distribution within each cluster.…

We consider the multi-collinear limit of multi-gluon QCD amplitudes at tree level. We use the MHV rules for constructing colour ordered tree amplitudes and the general collinear factorization formula to derive timelike splitting functions…

Nuclear clustering describes the appearance of structures resembling smaller nuclei such as alpha particles (4He nuclei) within the interior of a larger nucleus. While clustering is important for several well-known examples, much remains to…

A prescription is presented to construct manifestly gauge invariant tree-level scattering amplitudes with one or two off-shell initial-state gluons for processes with arbitrary particles in the final state, which allows for calculations…