Modeling Graphs with Vertex Replacement Grammars
arXiv:1908.03837 · doi:10.1109/ICDM.2019.00066
Abstract
One of the principal goals of graph modeling is to capture the building blocks of network data in order to study various physical and natural phenomena. Recent work at the intersection of formal language theory and graph theory has explored the use of graph grammars for graph modeling. However, existing graph grammar formalisms, like Hyperedge Replacement Grammars, can only operate on small tree-like graphs. The present work relaxes this restriction by revising a different graph grammar formalism called Vertex Replacement Grammars (VRGs). We show that a variant of the VRG called Clustering-based Node Replacement Grammar (CNRG) can be efficiently extracted from many hierarchical clusterings of a graph. We show that CNRGs encode a succinct model of the graph, yet faithfully preserves the structure of the original graph. In experiments on large real-world datasets, we show that graphs generated from the CNRG model exhibit a diverse range of properties that are similar to those found in the original networks.
Accepted as a regular paper at IEEE ICDM 2019. 15 pages, 9 figures
References in corpus (10)
- Fast unfolding of communities in large networks
- From Louvain to Leiden: guaranteeing well-connected communities
- LINE: Large-scale Information Network Embedding
- Stochastic blockmodels and community structure in networks
- Variational Graph Auto-Encoders
- Biological network comparison using graphlet degree distribution
- Kronecker Graphs: An Approach to Modeling Networks
- GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models
- NetGAN: Generating Graphs via Random Walks
- Growing Graphs with Hyperedge Replacement Graph Grammars