English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Understanding relational datasets at a high level is a common data mining task and the detection and classification of community structure is one of the foremost algorithmic challenges of data science. A common approach is to model a dataset with a graph and to use the arsenal of graph mining methods to describe the properties of the data and find desired structure. This arsenal includes many numerical linear algebra techniques. A well-known approach is to calculate a few eigenpairs of a matrix associated with the graph and use the information in the eigenvalues and eigenvectors to find diverse properties of the graph. Often these eigenpairs guide graph optimization processes to more efficient nearoptimal solution. For small and quasi-regular graphs, the choice from the buffet of graph-associated matrices is often unimportant as the performance of the technique may not depend much on which graph matrix is employed. However, in large graphs with highly skewed degree distribution, there are several important considerations in this choice. The calculation cost of finding the eigenvectors and the properties that are determined from these eigenvectors both differ dramatically depending which matrix and set of eigenvectors you choose. We present maximum principles and decay rates demonstrating, for scale-free graphs, the extremal eigenvectors of adjacency matrices are fundamentally different than those related to Laplacian matrices. The results suggest that adjacency eigenpairs could be effectively used to detect community structure of a given density involving many mediumto-high-degree vertices, but that their use is likely inappropriate for locating community structure in the low-degree portions of graphs. ∗Speaker and corresponding author, This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. KDD 2013 Chicago, Illiinois USA Copyright 2013 ACM X--XX-X/XX/XX ...$15.00.

Extremal eigenpairs of adjacency matrices wear their sleeves near their hearts: Maximum principles and decay rates for resolving community structure