Network Motif Frequency Detection

Statistically overrepresented subgraph patterns — the building blocks of networks

Network Motifs

Motifs are subgraph patterns that appear significantly more often in a real network than in random networks with the same degree sequence. Defined by Milo et al. (2002, Science).

Z-score = (N_real - μ_rand) / σ_rand μ_rand, σ_rand from ensemble of randomized networks Significance profile: SP_i = Z_i / √(Σ Z_j²) Key motifs in directed networks: FFL: feedforward loop FB: feedback loop BI: bi-fan 3-chain, etc.

Different network types have characteristic motif profiles: transcription networks favor FFL, neural networks favor feedback, food webs have distinct signatures.

3-chain
0
FFL
0
Feedback
0
Clique
0