Clustering coefficients for networks with higher order interactions
arXiv:2311.08563 · doi:10.1063/5.0188246
Abstract
We introduce a clustering coefficient for nondirected and directed hypergraphs, which we call the quad clustering coefficient. We determine the average quad clustering coefficient and its distribution in real-world hypergraphs and compare its value with those of random hypergraphs drawn from the configuration model. We find that real-world hypergraphs exhibit a nonnegligible fraction of nodes with a maximal value of the quad clustering coefficient, while we do not find such nodes in random hypergraphs. Interestingly, these highly clustered nodes can have large degrees and can be incident to hyperedges of large cardinality. Moreover, highly clustered nodes are not observed in an analysis based on the pairwise clustering coefficient of the associated projected graph that has binary interactions, and hence higher order interactions are required to identify nodes with a large quad clustering coefficient.
arXiv comment32 pages, 19 figures. Minor typo in equation (66) corrected
References in corpus (15)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Hierarchical Organization in Complex Networks
- Networks beyond pairwise interactions: structure and dynamics
- Clustering in Complex Directed Networks
- Simplicial Closure and higher-order link prediction
- Cycles and clustering in bipartite networks
- The clustering coefficient and community structure of bipartite networks
- Higher-order clustering in networks
- Loops of any size and Hamilton cycles in random scale-free networks
- Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks
- Measuring and Modeling Bipartite Graphs with Community Structure
- Hidden Variables in Bipartite Networks
- Triadic analysis of affiliation networks