Growing Graphs with Hyperedge Replacement Graph Grammars

08/10/2016
by   Salvador Aguiñaga, et al.
0

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering from the extraction process, the extracted graph grammar is guaranteed to generate an isomorphic copy of the original graph. Or, a stochastic application of the graph grammar rules can be used to quickly create random graphs. In experiments on large real world networks, we show that random graphs, generated from extracted graph grammars, exhibit a wide range of properties that are very similar to the original graphs. In addition to graph properties like degree or eigenvector centrality, what a graph "looks like" ultimately depends on small details in local graph substructures that are difficult to define at a global level. We show that our generative graph model is able to preserve these local substructures when generating new graphs and performs well on new and difficult tests of model robustness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2019

Edge Replacement Grammars: A Formal Language Approach for Generating Graphs

Graphs are increasingly becoming ubiquitous as models for structured dat...
research
06/11/2018

Growing Better Graphs With Latent-Variable Probabilistic Graph Grammars

Recent work in graph models has found that probabilistic hyperedge repla...
research
10/15/2018

Random clique covers for graphs with local density and global sparsity

Large real-world graphs tend to be sparse, but they often contain densel...
research
03/21/2023

Dynamic Vertex Replacement Grammars

Context-free graph grammars have shown a remarkable ability to model str...
research
10/18/2019

Towards Interpretable Graph Modeling with Vertex Replacement Grammars

An enormous amount of real-world data exists in the form of graphs. Ofte...
research
02/15/2023

SynGraphy: Succinct Summarisation of Large Networks via Small Synthetic Representative Graphs

We describe SynGraphy, a method for visually summarising the structure o...
research
09/15/2023

Generating Semantic Graph Corpora with Graph Expansion Grammar

We introduce Lovelace, a tool for creating corpora of semantic graphs. T...

Please sign up or login with your details

Forgot password? Click here to reset