Directed closure coefficient and its patterns
Authors:
Open Access
- 25 June 2021
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 16 (6) , e0253822
Abstract
The triangle structure, being a fundamental and significant element, underlies many theories and techniques in studying complex networks. The formation of triangles is typically measured by the clustering coefficient, in which the focal node is the centre-node in an open triad. In contrast, the recently proposed closure coefficient measures triangle formation from an end-node perspective and has been proven to be a useful feature in network analysis. Here, we extend it by proposing the directed closure coefficient that measures the formation of directed triangles. By distinguishing the direction of the closing edge in building triangles, we further introduce the source closure coefficient and the target closure coefficient. Then, by categorising particular types of directed triangles (e.g., head-of-path), we propose four closure patterns. Through multiple experiments on 24 directed networks from six domains, we demonstrate that at network-level, the four closure patterns are distinctive features in classifying network types, while at node-level, adding the source and target closure coefficients leads to significant improvement in link prediction task in most types of directed networks.Keywords
Funding Information
- Australian Research Council (DP19010108)
This publication has 39 references indexed in Scilit:
- Potential Theory for Directed NetworksPLOS ONE, 2013
- Graphlet-based edge clustering reveals pathogen-interacting proteinsBioinformatics, 2012
- Modeling scientific-citation patterns and other triangle-rich acyclic networksPhysical Review E, 2009
- Clustering signatures classify directed networksPhysical Review E, 2008
- Clustering in complex directed networksPhysical Review E, 2007
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- A General Framework for Weighted Gene Co-Expression Network AnalysisStatistical Applications in Genetics and Molecular Biology, 2005
- Modeling interactome: scale-free or geometric?Bioinformatics, 2004
- Overview of the 2003 KDD CupACM SIGKDD Explorations Newsletter, 2003
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002