In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recen...

The principal submatrix localization problem deals with recovering a K ×K principal submatrix of elevated mean μ in a large n × n symmetric matrix subject to additive standard Gaussian noise. This problem serves as a prototypical example for community detection, in which the community corresponds to the support of the submatrix. The main result of this paper is that in the regime Ω( √ n) ≤ K ≤ ...

Co-clustering has been extensively used in varied applications because of its potential to discover latent local patterns that are otherwise unapparent by usual unsupervised algorithms such as k-means. Recently, a unified view of co-clustering algorithms, called Bregman co-clustering (BCC), provides a general framework that even contains several existing co-clustering algorithms, thus we expect...

Clustering is one of the most popular methods for exploratory data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most famous clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, ...

Symmetry is a common feature in the real world. It may be used to improve a classification by using the point symmetry-based distance as a measure of clustering. However, it is time consuming to calculate the point symmetry-based distance. Although an efficient parallel point symmetry-based K-means algorithm (ParSym) has been propsed to overcome this limitation, ParSym may get stuck in sub-opti...

The K-core of a graph is the maximal subgraph within which each vertex connected to at least K other vertices. It fundamental network concept for understanding threshold cascading processes with discontinuous percolation transition. A minimum attack set contains smallest number vertices whose removal induces complete collapse K-core. Here we tackle this prototypical optimal initial-condition pr...

In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in 2-connected or 2-edge connected graphs. We provide some similar conditions for the existence of an odd or even circuit that passing a given vertex or an edge in 2-edge connected graphs. We show that if G is a 2-connected k-regular graph, k ≥ 3, then every edge ...

of message-passing services for the Blue Gene/L supercomputer G. Almási C. Archer J. G. Castaños J. A. Gunnels C. C. Erway P. Heidelberger X. Martorell J. E. Moreira K. Pinnow J. Ratterman B. D. Steinmacher-Burow W. Gropp B. Toonen The Blue Genet/L (BG/L) supercomputer, with 65,536 dualprocessor compute nodes, was designed from the ground up to support efficient execution of massively parallel ...