## Abstract

To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes characterized by common network properties, including but not limited to communities of densely connected nodes. Without any prior information about the nature of the groups, the method simultaneously identifies the number of groups, the group assignment, and the properties that define these groups. The results of applying our method to real networks suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

## Introduction

The highly structured internal organization of complex networks can both impact and reflect their dynamics and function^{1}. Previous work on identifying and studying this organization has focused mainly on network communities^{2,3,4,5,6,7,8,9,10,11,12,13}, which are subsets of nodes defined by the difference between their internal and external link density. To provide a fresh perspective on this problem, we seek to capture more general structures characterized by other network properties^{14,15,16,17}. For this purpose, we introduce the notion of *structural groups*, defined as subsets of nodes sharing common structural properties that set them apart from other nodes in the network. Using a given set of *p* ≫ 1 node properties (such as centrality and spectral properties) as the coordinates for each node in the *p*-dimensional space , we identify structural groups as clusters of points in this *node property space*. Figure 1 shows an illustrative example of a network for which no standard network visualization shows clear group structure (Fig. 1a). However, an appropriate two-dimensional projection in the node property space reveals a hidden but unambiguous three-group structure (Fig. 1b), which can be used to generate a far more informative layout of the network (Fig. 1e). Application of existing community detection methods^{18,19,20,21,22,23,24,25,26,27} is not expected to resolve these groups, since they are not distinguishable by link density alone (Fig. 1c). Neither is the direct application of existing clustering methods in the full node property space nor in the projection onto any lower-dimensional space, due to the known fact that groups with widely different scatter sizes may not be correctly grouped by unsupervised algorithms (Fig. 1d and Supplementary Fig. S1 online). Distinguishing structural groups may in general require a combination of two or more properties — Fig. 1b shows that the degree and the average degree of neighbors suffice for this example. It is difficult, however, to identify such a combination without knowing the groups a priori.

Our approach overcomes these difficulties using the visual processing ability of a human user as an integral part of the analysis. The approach is based on visual analytics^{28,29}, which is conceptualized as exploratory statistics in which analytical reasoning is facilitated by a visual interactive interface. Humans generally excel automated computer algorithms in visual recognition tasks, such as labeling images^{30} and deciphering distorted texts, which forms the basis of spam prevention systems and crowdsourcing for the digitalization of old books^{31}. We exploit this capability by asking the user to inspect a selection of two-dimensional projections of the node property space for possible separation of nodes into groups. Since any projection could potentially reveal good separation of groups, we first consider the result of choosing these projections randomly. For two clusters of points with a gap between them in high dimension, the probability can be very small for the clusters to be separable by a straight line in a random two-dimensional projection. This probability depends strongly on the “effective dimension” of the clusters. For example, if two Gaussian-distributed clusters of 100 points have their centers 6 units apart in the 28-dimensional space, the probability is less than 0.001 if the variance of the clusters in every direction is one, but increases to about 0.017 if the variance is reduced by a factor of 10 in all but 10 orthogonal directions. We find that the effective dimension is relatively small for the groups discovered in the networks considered here, most of them with dimension less than 12 (out of 28) when defined as the minimum number of principal components required to account for 90% of the variance within the group. To further enhance the probability of separating groups, we sample random projections with a systematic bias (see Methods). This increases the separation probability for the example of Gaussian clusters above to around 0.68 for a single projection. If the user visually recognizes separation of nodes into groups in a two-dimensional projection, the group assignment is entered through a graphical interactive interface (Fig. 2a–d, Supplementary Video S1 online). The integration of the visual component allows the user not only to supervise the process, but also to learn and create intuition from taking part in the process, thus facilitating the search for unanticipated network structures. It also accommodates naturally an ultimate goal of clustering algorithms, which is to reproduce how a human would group a given set of points.

The chance of capturing a group structure is even further enhanced by the multiplicative effect of using more than one projection. Indeed, the separation probability in the example above rises from 0.68 to above 0.999 with just 7 projections. In general, for a given number *L* of random projections, the probability that all of these projections fail to separate a given pair of group decreases to zero exponentially with *L*. After the user processes a given number *L* of projections, each node *i* in the network will be associated with a group assignment vector **a**^{(i)} representing the user input (Fig. 2d). Since we typically have a large number of distinct assignment vectors, we aggregate the corresponding nodes into a smaller, more meaningful number of structural groups by single-linkage hierarchical clustering^{32}. For this, we use the Hamming distance between the group assignment vectors of different nodes, **a**^{(i)} and **a**^{(j)}, which in this case is the number of projections for which the user has placed those nodes in different groups. This results in a dendrogram that we can cut at a threshold distance *d* to obtain a grouping, in which being in different groups indicates that the user has placed these nodes in different groups in at least *d* out of *L* projections (Fig. 2e; Supplementary Video S1 online). To compare the different groupings obtained at different thresholds, we define the *quality of grouping Q _{g}* by where vector represents node

*i*in the property space, vector

**c**

*is the center of group*

_{k}*k*, index

*k*denotes the group to which node

_{i}*i*belongs, and || · || defines the

*p*-dimensional Euclidean distance. The ratio of the two bracketed quantities in Eq. (1) measures the average separation distance between groups (the average over all pairs of groups, denoted ) relative to the spread within individual groups (the average over all nodes, denoted 〈·〉

*). This quantity is then normalized by a constant*

_{i}*q*, chosen to remove a systematic dependence of the quality of grouping on the number of groups

_{g}*K*(see Methods). As one lowers the threshold level, the quality of grouping

*Q*tends to drop sharply at a certain level (Fig. 2f). To obtain the maximum number of high-quality groups, we suggest choosing the group assignment, as well as the number of groups

_{g}*K*, at the threshold level just above the largest drop in

*Q*, which we call the

_{g}*Q*.

_{g}drop-off## Results

We implemented our *visual analytics method* using the selection of *p* = 28 node properties listed in Table I, which encompasses important node attributes that capture local information, such as degree and clustering, and others that capture more global information, such as betweenness centrality and Laplacian eigenvectors. In particular, the eigenvectors of the Laplacian and of the normalized Laplacian allow the detection of communities^{12,33,34,35,36} and bipartite or multipartite structures^{37}, respectively, as well as mixtures of these structures, assuring our method the ability to detect group structures defined by link density as special cases. Using this set of properties for the example network of Fig. 1, we obtain the dendrogram shown in Fig. 2e. The number of groups for this network is found to be *K* = 3 at the *Q _{g}* drop-off (Fig. 2f), which agrees with the group separation visible in the projection shown in Fig. 1b. This accurately reflects the fact that the network was synthetically constructed from three distinct structural groups: the first two groups characterized by high (≥ 65) and low (≤ 55) prescribed degrees, respectively, but connected randomly otherwise, and the third group characterized by higher connection probability with internal nodes (0.3) than with external ones (0.1). This example illustrates that our method is capable of discovering not only group structures defined by link density, but also more general group structures, even when different types of structures coexist in the same network. Moreover, as shown in Fig. 3 for two-group benchmark networks, the visual analytics method is generally expected to outperform existing methods if the groups have different internal structures, in this case determined by their different degree distributions (see Methods).

Figure 4 shows a visualization of the hierarchy of nested structural groups identified by applying our method to a selection of six real-world networks spanning different sizes and domains (Table II). To further characterize these groups, we rank the node properties based on a two-dimensional projection in which the discovered groups reveal maximal separation (see Methods). We then discard the low-ranking properties that have negligible effect on the group separation, keeping only those indicated under each panel. Surprisingly, while most groups cannot be identified using a single node property, the node structural groups are completely separated in this plane for four of the networks. The groups in three of the networks, the polbooks, netscience, and disease networks (Fig. 4d-f), are separated using two eigenvectors of the Laplacian matrix, suggesting that these groups could be similar to density-based communities detected by existing methods^{2}; when quantified by the Rand index^{38}, however, the similarity appears relatively low (Supplementary Fig. S2 online). The groups in a fourth network, the karate network (Fig. 4a), can also be separated in a plane, but this projection requires the use of 15 properties led by the average degree, average betweenness, and average subgraph centrality^{39} of neighbors (see Table I notes for the definition). The groups in the other two networks, the adjnoun and football networks (Fig. 4b–c), are mostly but not completely separated in this two-dimensional representation. We emphasize that it is not necessary for all the groups to be separable in a single two-dimensional projection. In fact, while each such projection may only illuminate part of the hidden group structure (such as the separation between a single group and all the others), the multiplicative effect of integrating information from many random projections is what often reveals the full high-dimensional structure.

Another remarkable feature of this approach is that, because we do not know in advance which properties define the groups we seek to identify, the visual analytics method simultaneously provides the answer to the question—the number and identity of the structural groups—along with the question itself—the properties that define these groups. Even when these properties are abstract, further analysis can easily reveal the nature of the network's internal organization. For example, consider the karate network, whose nodes are members of a karate club and links are interactions between two members in at least one context external to the club activities. The three structural groups identified in Fig. 4a correspond to (1) members who are central to the club and interact with many other members; (2) peripheral members interacting only with very few, but central members; and (3) members forming a community connected to the rest of the network only through one central member (Supplementary Fig. S3 online). Incidentally, one of the groups we identify consists of nodes that are connected to those outside the group but to none within the group. This social group structure is markedly different from the well-studied eventual split of the club into two clubs^{40}.

As an additional example, consider the football network, where nodes are college American football teams and links indicate matches played in the 2000 season. Although the teams are organized into 12 conferences (including Independents), our method identifies 7 structural groups (Fig. 4c). As shown in Figs. 5a and 5b, groups 1 and 6 are characterized by the combination of high degrees, high subgraph centrality, and the same characteristics for their neighbors, while these two groups are distinct in clustering coefficient and some Laplacian eigenvectors. Low degrees and low subgraph centrality, as well as the same characteristics for the neighbors, distinguish groups 4 and 7 from others, while they differ in their clustering coefficient and a few Laplacian eigenvectors. Group 2 shows similar characteristics as group 1 in terms of subgraph centrality, but the mean shortest path distance is very high and the betweenness centrality of the neighbors is very low, reflecting the peripheral location of these nodes within the network. Many of the Laplacian eigenvectors contribute to the separation of the groups, which is consistent with the fact that a density-based community structure exists in addition to other group structures. In particular, groups 3 and 5 are communities that can only be distinguished by the differences in the Laplacian eigenvectors and clustering coefficient. Grouping together Big Twelve and Mountain West as well as Atlantic Coast and Big East, but splitting the Independents (Fig. 5c), this group structure captures a higher-level organization of the conferences which is determined by the geographic proximity of the teams (Fig. 5d). Similar geographical manifestation of network communities has recently been observed in the effective boundaries defined by human mobility in the US^{41} and telecommunications in Great Britain^{42}.

## Discussion

The structural groups identified by the visual analytics method are characterized by common network properties. This provides a foundation for the study of the interplay between form and function in complex networks, as network dynamics (and hence function) is believed to be strongly influenced by network structure. The possibilities are extensive with our approach since the user has complete freedom to choose the set of *p* node properties. Within the wide range of possible structures expressible through these properties, the visual analytics method can help discover a specific group structure of interest and interpret it using a ranking of the node properties. The approach can be easily adapted to identify network structures defined by link rather than node characteristics^{43}. Moreover, it can be applied to networks whose nodes have quantifiable (but not necessarily structural) properties^{44}, such as age, income and level of education in the case of social networks, which remain elusive in existing network representations. Systematic benchmarking using synthetic networks shows that our method has advantages over existing methods in identifying density-based communities with distinct internal structures (red vs. blue curve in Fig. 3). Naturally, existing methods such as the one proposed in Ref. 14 may still be more effective in resolving specific networks not represented in our benchmarks. In finding general structural groups beyond density-based communities, the visual analytics method outperforms the direct application of standard clustering algorithms in the full node property space (Fig. 1; Supplementary Fig. S1 online; red vs. green/purple curve in Fig. 3). This suggests that our approach also has potential to be an alternative for solving general high-dimensional clustering problems. The replacement of the human component in the visual analytics method with a simple heuristics based on *K*-means yields a fully objective unsupervised algorithm, which performs much better than various extensions of *K*-means directly applied to the full node property space (orange vs. green/purple curves in Fig. 3). This highlights the critical role played by the integrative analysis of clustering outputs from multiple projections. Although the visual analytics method converted to an unsupervised algorithm performs better than standard unsupervised approaches, the original formulation with the human component is still more effective (red vs. orange curve in Fig. 3). By combining the pattern recognition ability of humans with the processing capability of computers, our visual analytics method can resolve the internal organization of complex networks better than either of them alone.

## Methods

### Biased random projections

To enhance the probability of resolving group separation, we first choose each node property *j* with probability *r _{j}* (while requiring a minimum of four properties) and generate a random projection using those selected properties. The probability

*r*is designed to reflect the relative importance of property

_{j}*j*in separating the groups. We set , where , and

*v*denotes the

_{k,j}*j*th component of the normalized basis vector for the

*k*th (out of

*N*) one-dimensional projections generated randomly and uniformly. The weights

*w*are given by

_{k}*w*: = max

_{k}*(*

_{i}*z*

_{k,i}_{+1}–

*z*) · (

_{k,i}*i*/

*n*)·(1–

*i*/

*n*), where denote the ordered points in the

*k*th projection for all

*n*nodes in the network. The parameter

*α*can be used to adjust the bias strength and was taken to be 2 in all computations.

### Controlling for group-size effect in *Q*_{g}

_{g}

Since smaller groups naturally tend to have smaller within-group variations, the ratio of the averages in Eq. (1) increases with the number of groups *K*, even when the groups are not necessarily better separated. To correct for this bias, we define *Q _{g}* by normalizing the ratio by its expected value

*q*for randomized groupings with the individual group sizes kept fixed. We estimated

_{g}*q*by averaging over 100 realizations.

_{g}### Two-group benchmark networks

For the benchmarking results shown in Fig. 3, we used networks having two groups, constructed as follows. In the larger group (150 nodes), nodes are connected randomly, with the degree of each node fixed to a random integer chosen uniformly between 10 and 70. In the smaller group (50 nodes), node pairs are connected randomly with fixed probability *p*_{in}. Across the two groups, node pairs are connected with probability *p*_{out}. For a given *p*_{out}, we choose *p*_{in} to match the average degree in the smaller group with the average internal degree in the larger group. The probability *p*_{out} is varied between 0 (two completely isolated groups) and 40/150 ≈ 0.27 (no internal links in the smaller group), with *p*_{out} = 20/150 ≈ 0.13 corresponding to the point at which the average internal and external degrees in the smaller group are equal.

### Benchmarking procedure

We used the two-group network described in the subsection above to compare performance of various methods for identifying the groups. For our visual analytics method, we used the node properties listed in Table I and generated 30 biased random projections. The threshold level for the resulting dendrogram was selected so as to produce two groups. In a few cases where a two-group threshold does not exist, we selected the threshold that results in the smallest possible number of groups above two. For the mixture model method^{14}, the number of groups was set to *K* = 2. For *K*-means^{45}, the algorithm was applied directly to the node property space with *K* = 2. For completeness, we also examined the performance of *K*-means using all possible combinations of choices for (i) kernel^{46} (linear, polynomial, Gaussian, or sigmoid); (ii) dimensionality reduction (projecting the data points in the node property space onto the 2, 5, 10, 15, or 20 leading principal components, or no reduction); and (iii) normalization (scaling each node property to have zero mean and unit variance, normalizing each property to the unit interval [0, 1], or no normalization). Scaling for zero mean and unit variance is equivalent to weighing each node property equally when measuring distances in the node property space, while normalizing to the unit interval ensures that all the node properties are distributed in the same range. For the unsupervised variant of our visual analytics method, the human user was replaced by the (linear) *K*-means algorithm with *K* = 1, 2, … , 10 to analyze each two-dimensional projection, with an optimal choice of *K* determined by the gap statistic^{47}, which is defined based on a characteristic signature in the *K*-dependence of the within-group variation. The performance of each method was measured by the adjusted Rand index *R* between the computed and the true groupings (see the subsection below for definition).

### Rand index

This index measures the similarity between two ways of grouping a given set of discrete objects, possibly into different numbers of groups. For a given pair of groupings of network nodes, the adjusted Rand index *R* is defined as the normalized fraction of node pairs that are either classified in the same group in both groupings or classified in different groups in both groupings^{38}. The normalization implies that *R* = 1 for identical groupings and *R* ≈ 0 for a pair of random groupings.

### Ranking node properties

For a given node grouping, we seek a two-dimensional projection that maximizes , a group separation measure similar to that in Eq. (1) but computed for the projected points after the groups have been identified. Here *n _{k}* denotes the number of nodes in group

*k*, and

**c**denotes the center of all the data points. Such a projection plane can be efficiently found by a spectral method

^{48}based on the QR decomposition. The node properties are then ranked in the order of increasing angle between their coordinate axes and the projection plane.

### Software

A version of the visual analytics software that implements our method for all the networks discussed in this article is available at http://purl.oclc.org/net/find_structural_groups

## References

- 1.
Strogatz, S. H. Exploring complex networks.

*Nature***410**, 268–276 (2001). - 2.
Girvan, M. & Newman, M. E. J. Community structure in social and biological networks.

*Proc. Natl. Acad. Sci. USA***99**, 7821–7826 (2002). - 3.
Guimera, R., Sales-Pardo, M. & Amaral, L. Modularity from fluctuations in random graphs and complex networks.

*Phys. Rev. E***70**, 025101 (2004). - 4.
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V. & Parisi, D. Defining and identifying communities in networks.

*Proc. Natl. Acad. Sci. USA***101**, 2658–2663 (2004). - 5.
Palla, G., Derenyi, I., Farkas, I. & Vicsek, T. Uncovering the overlapping community structure of complex networks in nature and society.

*Nature***435**, 814–818 (2005). - 6.
Reichardt, J. & Bornholdt, S. Statistical mechanics of community detection.

*Phys. Rev. E***74**, 016110 (2006). - 7.
Danon, L., Diaz-Guilera, A. & Arenas, A. The effect of size heterogeneity on community identification in complex networks.

*J. Stat. Mech.-Theory E.***2006**, P11010 (2006). - 8.
Fortunato, S. & Barthelemy, M. Resolution limit in community detection.

*Proc. Natl. Acad. Sci. USA***104**, 36–41 (2007). - 9.
Chauhan, S., Girvan, M. & Ott, E. Spectral properties of networks with community structure.

*Phys. Rev. E***80**, 056114 (2009). - 10.
Porter, M. A., Onnela, J. P. & Mucha, P. J. Communities in networks.

*Notices Amer. Math. Soc.***56**, 1082–1097 (2009). - 11.
Chen, P. & Redner, S. Community structure of the physical review citation network.

*J. Informetr.***4**, 278–290 (2010). - 12.
Fortunato, S. Community detection in graphs.

*Phys. Rep.***486**, 75–174 (2010). - 13.
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A. & Onnela, J. P. Community structure in time-dependent, multiscale, and multiplex networks.

*Science***328**, 876–878 (2010). - 14.
Newman, M. E. J. & Leicht, E. A. Mixture models and exploratory analysis in networks.

*Proc. Natl. Acad. Sci. USA***104**, 9564–9569 (2007). - 15.
Ravasz, E., Somera, A., Mongru, D., Oltvai, Z. & Barabási, A. Hierarchical organization of modularity in metabolic networks.

*Science***297**, 1551–1555 (2002). - 16.
Sreenivasan, S., Cohen, R., Lóopez, E., Toroczkai, Z. & Stanley, H. E. Structural bottlenecks for communication in networks.

*Phys. Rev. E***75**, 036105 (2007). - 17.
Costa, L. da, F., Villas Boas, P. R., Silva, F. N. & Rodrigues, F. A. A pattern recognition approach to complex networks.

*J. Stat. Mech.***2010**, P11015 (2010). - 18.
Bagrow, J. & Bollt, E. Local method for detecting communities.

*Phys. Rev. E***72**, 046108 (2005). - 19.
Clauset, A. Finding local community structure in networks.

*Phys. Rev. E***72**, 026132 (2005). - 20.
Raghavan, U. N., Albert, R. & Kumara, S. Near linear time algorithm to detect community structures in large-scale networks.

*Phys. Rev. E***76**, 036106 (2007). - 21.
Rosvall, M. & Bergstrom, C. T. An information-theoretic framework for resolving community structure in complex networks.

*Proc. Natl. Acad. Sci. USA***104**, 7327–7331 (2007). - 22.
Hofman, J. M. & Wiggins, C. H. Bayesian approach to network modularity.

*Phys. Rev. Lett.***100**, 258701 (2008). - 23.
Kovacs, I., Palotai, R., Szalay, M. & Csermely, P. Community landscapes: An integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics.

*PLoS ONE***5**, e12528 (2010). - 24.
Estrada, E. Community detection based on network communicability.

*Chaos***21**, 016103 (2011). - 25.
Lancichinetti, A., Radicchi, F., Ramasco, J. J. & Fortunato, S. Finding statistically significant communities in networks.

*PLoS ONE***6**, e18961 (2011). - 26.
Psorakis, I., Roberts, S., Ebden, M. & Sheldon, B. Overlapping community detection using bayesian non-negative matrix factorization.

*Phys. Rev. E***83**, 066114 (2011). - 27.
Wen, H., Leicht, E. A. & D'Souza, R. M. Improving community detection in networks by targeted node removal.

*Phys. Rev. E***83**, 016114 (2011). - 28.
Thomas, J. J. & Cook, K. A. A visual analytics agenda.

*IEEE Comput. Graph.***26**, 10–13 (2006). - 29.
Keim, D., Mansmann, F., Schneidewind, J., Thomas, J., & Ziegler, H.

*Visual Analytics: Scope and Challenges*, in*Visual Data Mining*, eds. Simoff S. J., , Böhlen M. H., & Mazeika A., Vol. 4404 of*Lec. Notes Comput. Sc.*, 76–90 (Springer, Berlin/Heidelberg, 2008). - 30.
von Ahn, L. & Dabbish, L. Labeling images with a computer game., in

*Proceedings of the SIGCHI conference on human factors in computing systems*, 319–326 (ACM, 2004). - 31.
von Ahn, L., Maurer, B., McMillen, C., Abraham, D. & Blum, M. reCAPTCHA: Human-based character recognition via web security measures.

*Science***321**, 1465–1468 (2008). - 32.
Jain, A., Murty, M. & Flynn, P. Data clustering: A review.

*ACM Comput. Surv.***31**, 264–323 (1999). - 33.
Donetti, L. & Muñoz, M. A. Detecting network communities: a new systematic and efficient algorithm.

*J. Stat. Mech.***2004**, P10012 (2004). - 34.
Seary, A. J. & Richards, W. D. Partitioning networks by eigenvectors., in

*Proceedings of the International Conference on Social Networks*,**Vol. 1**, 47–58 (1995). - 35.
Pothen, A., Simon, H. D. & Liou, K. P. Partitioning sparse matrices with eigenvectors of graphs.

*SIAM J. Matrix Anal. Appl.***11**, 430–452 (1990). - 36.
Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices.

*Phys. Rev. E***74**, 036104 (2006). - 37.
Chung, F.

*Spectral Graph Theory*(American Mathematical Society, Province, 1997). - 38.
Hubert, L. & Arabie, P. Comparing partitions.

*J. Classif.***2**, 193–218 (1985). - 39.
Estrada, E. & Rodŕiguez-Veĺazquez, J. A. Subgraph centrality in complex networks.

*Phys. Rev. E***71**, 056103 (2005). - 40.
Zachary, W. W. An information flow model for conflict and fission in small groups.

*J. Anthro. Res.***33**, 452–473 (1977). - 41.
Thiemann, C., Theis, F., Grady, D., Brune, R. & Brockmann, D. The structure of borders in a small world.

*PLoS ONE***5**, e15422 (2010). - 42.
Ratti, C., Sobolevsky, S., Calabrese, F., Andris, C., Reades, J., Martino, M., Claxton, R. & Strogatz, S. H. Redrawing the map of Great Britain from a network of human interactions.

*PLoS ONE***5**, e14248 (2010). - 43.
Ahn, Y. Y., Bagrow, J. P. & Lehmann, S. Link communities reveal multiscale complexity in networks.

*Nature***466**, 761–764 (2010). - 44.
Bianconi, G., Pin, P. & Marsili, M. Assessing the relevance of node features for network structure.

*Proc. Natl. Acad. Sci. USA***106**, 11433–11438 (2009). - 45.
Lloyd, S. P. Least squares quantization in PCM.

*IEEE T. Inform. Theory***28**, 129–137 (1982). - 46.
Schölkopf, B., Smola, A. & Müller, K. Nonlinear component analysis as a kernel eigenvalue problem.

*Neural Comput.***10**, 1299–1319 (1998). - 47.
Tibshirani, R., Walther, G. & Hastie, T. Estimating the number of clusters in a dataset via the gap statistic.

*J. Roy. Stat. Soc. B***32**, 411–423 (2001). - 48.
Park, H., Drake, B., Lee, S. & Park, C. Fast linear discriminant analysis using QR decomposition and regularization.

*Georgia Institute of Technology, GA, Tech. Rep. GT-CSE-07-21*(2007). - 49.
Krebs, V. http://www.orgnet.com/

- 50.
Goh, K. I., Cusick, M. E., Valle, D., Childs, B., Vidal, M. & Barabási, A. L. The human disease network.

*Proc. Natl. Acad. Sci. USA***104**, 8685–8690 (2007). - 51.
Gürsoy, A. & Atun, M. Neighbourhood preserving load balancing: A self-organizing approach., in

*Euro-Par 2000 Parallel Processing*, eds. Bode A., , Ludwig T., , Karl W., & Wismüller R., Vol. 1900 of*Lec. Notes Comput. Sc.*, 234–241 (Springer, Berlin/Heidelberg, 2000).

## Acknowledgements

This work was supported by NSF DMS/FODAVA Grant No. 0808860.

## Author information

## Affiliations

### Department of Mathematics, Clarkson University, Potsdam, NY 13699, USA

- Takashi Nishikawa

### Department of Physics and Astronomy and Northwestern Institute on Complex Systems, Northwestern University, Evanston, IL 60208, USA

- Adilson E. Motter

### Department of Molecular Biology, Princeton University, Princeton, NJ 08544, USA

- Adilson E. Motter

## Authors

### Search for Takashi Nishikawa in:

### Search for Adilson E. Motter in:

### Contributions

T.N. and A.E.M. designed the research, performed the research, and wrote the manuscript.

### Competing interests

The authors declare no competing financial interests.

## Corresponding author

Correspondence to Takashi Nishikawa.

## Supplementary information

## PDF files

- 1.
### Supplementary Information

Supplementary Information

## Videos

- 1.
### Supplementary Information

Supplementary Video S1

## Rights and permissions

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareALike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/

To obtain permission to re-use content from this article visit RightsLink.

## About this article

## Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.