Table 3 Analytics on Homological cycles. For each category we show the number of cycles in the graph ( \(\pmb{\beta_{1}}\) ), \(\pmb{\beta_{1}}\) divided by n , the total number of authors in each category, and the percentage of triangles in the graph that don’t satisfy triadic closure, that is \(\pmb{\frac{\mbox{\# cycles of length 3}}{\mbox{\# triangles in the graph}}}\) . Note that by number of triangles in the graph we mean the number of closed paths of length three in the co-authorship network

From: The shape of collaborations