Skip to main content
  • Austin Benson - Higher-order clustering coefficients

  • Wednesday, October 04, 2017 2:00 PM - 3:00 PM EDT
    LWSN 3102
    Purdue University

    Abstract:
    The tendency for real-world networks to cluster is the basis for many models and algorithms used to study complex systems, and the standard measurement of this tendency is the clustering coefficient, which is the probability that a length-2 path is "closed", i.e., induces a triangle. However, higher-order structures beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order patterns is not well understood. Here we introduce higher-order clustering coefficients, which measure the closure probability of higher-order cliques. These higher-order clustering coefficients reveal new insights into how real-world networks cluster.

    Presented by:
    Austin Benson
    Postdoc, Computer Science
    Cornell University
    Web page



Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at sciencehelp@purdue.edu for trouble accessing this page. Made possible by grant NSF CCF-0939370