Related papers: Correlation of clusters: Partially truncated corre…
With inspiration from Random Forests (RF) in the context of classification, a new clustering ensemble method---Cluster Forests (CF) is proposed. Geometrically, CF randomly probes a high-dimensional data cloud to obtain "good local…
Cluster Dynamical Mean Field Theories are analyzed in terms of their semiclassical limit and their causality properties, and a translation invariant formulation of the cellular dynamical mean field theory, PCDMFT, is presented. The…
Based on the self-energy-functional approach proposed recently [M. Potthoff, Eur. Phys. J. B 32, 429 (2003)], we present an extension of the cluster-perturbation theory to systems with spontaneously broken symmetry. Our method applies to…
A self-energy-functional approach is applied to construct cluster approximations for correlated lattice models. It turns out that the cluster-perturbation theory (Senechal et al, PRL 84, 522 (2000)) and the cellular dynamical mean-field…
The clustering coefficient quantifies the abundance of connected triangles in a network and is a major descriptive statistics of networks. For example, it finds an application in the assessment of small-worldness of brain networks, which is…
In a series of previous papers we developed a purely field model of microphenomena, so called prequantum classical statistical field theory (PCSFT). This model not only reproduces important probabilistic predictions of QM including…
In a recent work [D. Malpetti and T. Roscilde, arXiv:1605.04223] we have shown that in quantum many-body systems at finite temperature, two-point correlations can be formally separated into a thermal part, and a quantum part -- and that…
Identifying clusters of similar elements in a set is a common task in data analysis. With the immense growth of data and physical limitations on single processor speed, it is necessary to find efficient parallel algorithms for clustering…
Metrics on rooted phylogenetic trees are integral to a number of areas of phylogenetic analysis. Cluster-similarity metrics have recently been introduced in order to limit skew in the distribution of distances, and to ensure that trees in…
It is shown how to adapt the non-perturbative coupled cluster method of many-body theory so that it may be successfully applied to Hamiltonian lattice $SU(N)$ gauge theories. The procedure involves first writing the wavefunctions for the…
After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…
Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…
Identifying and quantifying spatial correlation are important aspects of studying the collective behaviour of multi-agent systems. Pair correlation functions (PCFs) are powerful statistical tools which can provide qualitative and…
Coagulation-fragmentation processes describe the stochastic association and dissociation of particles in clusters. Cluster dynamics with cluster-cluster interactions for a finite number of particles has recently attracted attention…
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, however, is NP-hard and practically hampered already by the…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
A cluster mean-field method is introduced and the applications to the Ising and Heisenberg models are demonstrated. We divide the lattice sites into clusters whose size and shape are selected so that the equivalence of all sites in a…
There are well-known constructions of integrable systems which are chains of infinitely many copies of the equations of the KP hierarchy ``glued'' together with some additional variables, e.g., the modified KP hierarchy. Another…
We establish Krylov-Safonov type H\"older regularity theory for solutions to quite general discrete dynamic programming equations or equivalently discrete stochastic processes on random geometric graphs. Such graphs arise for example from…
The usual procedure of including a finite number of vertices in Non Perturbative Renormalization Group equations in order to obtain $n$-point correlation functions at finite momenta is analyzed. This is done by exploiting a general method…