A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The study of triangles in graphs is a standard tool in network analysis. Real-world networks are often directed and have a significant fraction of reciprocal edges. Direction leads to many complexities, and it can be difficult to "measure" this structure meaningfully. We propose a collection of directed closure values that are analogues of the classic transitivity measure (the fraction of wedges that participate in triangles). Our study of these values reveals a wealth of information of thedoi:10.1093/comnet/cnv032 fatcat:vsevnvoferdl3muxergsd57lka