Motif Conservation Laws for the Configuration Model
arXiv:1408.6303
Abstract
The observation that some subgraphs, called motifs, appear more often in real networks than in their randomized counterparts has attracted much attention in the scientific community. In the prevalent approach the detection of motifs is based on comparing subgraph counts in a network with their counterparts in the configuration model with the same degree distribution as the network. In this short note we derive conservation laws that relate motif counts in the configuration model.
arXiv comment3 pages, 3 figures
References in corpus (5)
- Random graphs with arbitrary degree distributions and their applications
- Random graphs with clustering
- On the uniform generation of random graphs with prescribed degree sequences
- Random graphs containing arbitrary distributions of subgraphs
- Network motifs come in sets: correlations in the randomization process