Using network function to define and identify community structure

  • Chauhan S
  • Girvan M
  • Ott E
  • 6

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

We investigate a functional definition of community structure in complex
networks. In particular, we consider networks whose function is enhanced by the
ability to synchronize and/or by resilience to node failures. Previous work has
shown that the largest eigenvalue of the network's adjacency matrix provides
insight into both synchronization and percolation processes. Thus, for networks
whose goal is to perform these functions, we propose a method that divides a
given network into communities based on maximizing the largest eigenvalues of
the adjacency matrices of the resulting communities.

Author-supplied keywords

  • Data Analysis, Statistics and Probability
  • Physics and Society

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Sanjeev Chauhan

  • Michelle Girvan

  • Edward Ott

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free