Related papers: Cluster mechanisms in the fully frustrated Ising m…
We introduce a new method for performing clustering with the aim of fitting clusters with different scatters and weights. It is designed by allowing to handle a proportion $\alpha$ of contaminating data to guarantee the robustness of the…
We consider the problem of decentralized clustering and estimation over multi-task networks, where agents infer and track different models of interest. The agents do not know beforehand which model is generating their own data. They also do…
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we study two important…
We address the problem of federated learning (FL) where users are distributed and partitioned into clusters. This setup captures settings where different groups of users have their own objectives (learning tasks) but by aggregating their…
The frustration properties of the Ising model on a one-dimensional monoatomic equidistant lattice are investigated taking into account the exchange interactions of atomic spins at the sites of the first (nearest), second (next-nearest) and…
Clustering attempts to partition data instances into several distinctive groups, while the similarities among data belonging to the common partition can be principally reserved. Furthermore, incomplete data frequently occurs in many…
The problem of finding clusters in complex networks has been extensively studied by mathematicians, computer scientists and, more recently, by physicists. Many of the existing algorithms partition a network into clear clusters, without…
The learned weights of a neural network have often been considered devoid of scrutable internal structure. In this paper, however, we look for structure in the form of clusterability: how well a network can be divided into groups of neurons…
This paper presents a model for a dynamical system where particles dominate edges in a complex network. The proposed dynamical system is then extended to an application on the problem of community detection and data clustering. In the case…
Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data…
A geometric approach to critical fluctuations of a nonequilibrium model is reported. The two-dimensional majority vote model was investigated by Monte Carlo simulations on square lattices of various sizes and a detailed scaling analysis of…
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to…
The frustrated Ising model on a two-dimensional lattice with open boundary conditions is revisited. A hidden Z2 gauge symmetry relates models with different frustrations which, however, share the same partition function. By means of a…
The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only a small subset of the data. In this paper,…
In recent years, much of the research on clustering algorithms has primarily focused on enhancing their accuracy and efficiency, frequently at the expense of interpretability. However, as these methods are increasingly being applied in…
Cluster synchronization in synthetic networks of coupled chaotic oscillators is investigated. It is found that despite the asymmetric nature of the network structure, a subset of the oscillators can be synchronized as a cluster while the…
At low temperatures, weakly coupled spin chains develop a magnetic order that reflects the character of gapless spin fluctuations along the chains. Using nuclear magnetic resonance, we identify and characterize two ordered states in the…
We study the percolation properties of geometrical clusters defined in the overlap space of two statistically independent replicas of a square-lattice Ising model that are simulated at the same temperature. In particular, we consider two…
We study the dynamical properties of the fully frustrated Ising model. Due to the absence of disorder the model, contrary to spin glass, does not exhibit any Griffiths phase, which has been associated to non-exponential relaxation dynamics.…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…