Reports

Higher-order organization of complex networks

See allHide authors and affiliations

Science  08 Jul 2016:
Vol. 353, Issue 6295, pp. 163-166
DOI: 10.1126/science.aad9029

eLetters is an online forum for ongoing peer review. Submission of eLetters are open to all. eLetters are not edited, proofread, or indexed.  Please read our Terms of Service before submitting your own eLetter.

Compose eLetter

Plain text

  • Plain text
    No HTML tags allowed.
  • Web page addresses and e-mail addresses turn into links automatically.
  • Lines and paragraphs break automatically.
Author Information
First or given name, e.g. 'Peter'.
Your last, or family, name, e.g. 'MacMoody'.
Your email address, e.g. higgs-boson@gmail.com
Your role and/or occupation, e.g. 'Orthopedic Surgeon'.
Your organization or institution (if applicable), e.g. 'Royal Free Hospital'.
Statement of Competing Interests
CAPTCHA

This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.

Image CAPTCHA
Enter the characters shown in the image.

Vertical Tabs

  • Hypergraph-based spectral clustering of higher-order network structures
    • Tom Michoel, Reader, The Roslin Institute, The University of Edinburgh
    • Other Contributors:
      • Bruno Nachtergaele, Professor, Department of Mathematics, University of California Davis

    The authors refer to our work [T Michoel et al, Mol. Bio. Syst. 7, 2769 (2011)] where we introduced an algorithm for clustering networks on the basis of 3-node network motifs, but appear to have missed our subsequent work where this algorithm was extended into a general spectral clustering algorithm for hypergraphs [T Michoel and B Nachtergaele, Phys Rev E 86, 05611 (2012), https://arxiv.org/abs/1205.3630]. As a special case, and similar to SNAP, this algorithm can be (and was) used to cluster signed, colored or weighted networks based on network motifs or subgraph patterns of arbitrary size and shape, including patterns of unequal size such as shortest paths. An implementation of the algorithm is available at this URL: https://github.com/tmichoel/schype.

    Competing Interests: None declared.