2000 character limit reached
Motif Conservation Laws for the Configuration Model (1408.6303v1)
Published 27 Aug 2014 in q-bio.MN, cs.SI, and physics.soc-ph
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.