Subgraphs and network motifs in geometric networks
Shalev Itzkovitz, Uri Alon

TL;DR
This paper analytically investigates the occurrence of subgraphs and network motifs in geometric networks, revealing which motifs arise from geometric constraints and which are likely due to other biological or social factors.
Contribution
The study provides analytical solutions for subgraph counts in geometric networks, including models with arbitrary degree sequences and directional biases, and identifies invariant motif ratios.
Findings
Analytical formulas for 3 and 4-node subgraphs in geometric networks.
Invariant measures such as feedback to feed-forward loop ratios.
Many real-world motifs are not explained solely by geometric constraints.
Abstract
Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in abstract spaces such as multivariate biological or economic datasets and models of social networks. These networks often display network motifs: subgraphs that recur in the network much more often than in randomized networks. To understand the origin of the network motifs in these networks, it is important to study the subgraphs and network motifs that arise solely from geometric constraints. To address this, we analyze geometric network models, in which nodes are arranged on a lattice and edges are formed with a probability that decays with the distance between nodes. We present analytical solutions for the numbers of all 3 and 4-node subgraphs, in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
