Related papers: Correlations in random cluster model at $q=1$
Automatic machine learning-based detectors of various psychological and social phenomena (e.g., emotion, stress, engagement) have great potential to advance basic science. However, when a detector $d$ is trained to approximate an existing…
Correlation Clustering is a powerful graph partitioning model that aims to cluster items based on the notion of similarity between items. An instance of the Correlation Clustering problem consists of a graph $G$ (not necessarily complete)…
Measuring graph clustering quality remains an open problem. To address it, we introduce quality measures based on comparisons of intra- and inter-cluster densities, an accompanying statistical test of the significance of their differences…
Quantum periodic cluster methods for strongly correlated electron systems are reformulated and developed. The reformulation and development are based on a canonical transformation which periodizes the fermions in the cluster space. The…
Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…
Adjusted similarity measures, such as Cohen's kappa for inter-rater reliability and the adjusted Rand index used to compare clustering algorithms, are a vital tool for comparing discrete labellings. These measures are intended to have the…
Entanglement does not describe all quantum correlations and several authors have shown the need to go beyond entanglement when dealing with mixed states. Various different measures have sprung up in the literature, for a variety of reasons,…
The so-called diluted-random-cluster model may be viewed as a random-cluster representation of the Blume--Capel model. It has three parameters, a vertex parameter $a$, an edge parameter $p$, and a cluster weighting factor $q$. Stochastic…
A relational dataset is often analyzed by optimally assigning a label to each element through clustering or ordering. While similar characterizations of a dataset would be achieved by both clustering and ordering methods, the former has…
The kind of information provided by a measurement is determined in terms of the correlation established between observables of the apparatus and the measured system. Using the framework of quantum measurement theory, necessary and…
We explore the flow of quantum correlations in cluster states defined on ladder type graphs as measurements are done on qubits located on the nodes of the cluster. We focus on three qubits at the end of the ladder and compute the…
We investigate the spectral fluctuation properties of constrained ensembles of random matrices (defined by the condition that a number N(Q) of matrix elements vanish identically; that condition is imposed in unitarily invariant form) in the…
When a quantum system is divided into two local subsystems, measurements on the two subsystems can exhibit correlations beyond those possible in a classical joint probability distribution; these are partially explained by entanglement, and…
Quantum Analogical Modeling (QAM) works under the assumption that the correct exemplar-based description for a system of behavior minimizes the overall uncertainty of the system. The measure used in QAM differs from the traditional…
The QQ plot is a commonly used technique for informally deciding whether a univariate random sample of size n comes from a specified distribution F. The QQ plot graphs the sample quantiles against the theoretical quantiles of F and then a…
It is shown that Quantum Mechanics is ambiguous when predicting relative frequencies for an entangled system if the measurements of both subsystems are performed in spatially separated events. This ambiguity gives way to unphysical…
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…
This paper suggests five measures of association between two random vectors X = (X_1, ..., X_p) and Y = (Y_1, ..., Y_q). They are copula based and therefore invariant with respect to the marginal distributions of the components X_i and Y_j.…
We prove that for q>=1, there exists r(q)<1 such that for p>r(q), the number of points in large boxes which belongs to the infinite cluster has a normal central limit behaviour under the random cluster measure phi_{p,q} on Z^d, d>=2.…
Several clustering frameworks with interactive (semi-supervised) queries have been studied in the past. Recently, clustering with same-cluster queries has become popular. An algorithm in this setting has access to an oracle with full…