{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/modeling-graphs-with-vertex-replacement","title":"Modeling Graphs with Vertex Replacement Grammars","arxiv_id":"1908.03837","date":"2019-08-11","proceeding":null,"authors":["Satyaki Sikdar","Justus Hibshman","Tim Weninger"],"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.","url_abs":"http://arxiv.org/abs/1908.03837v2","url_pdf":"http://arxiv.org/pdf/1908.03837v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"modeling-graphs-with-vertex-replacement","repo_url":"https://github.com/satyakisikdar/VRG","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1908.03837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03837"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/satyakisikdar/VRG","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":11},"by_repo_kind":{"official":{"samples":11,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"f8c211509d36a438","entry":"GCD","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/GCD.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/GCD.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f8c211509d36a438"}},{"code_sha256_prefix":"30db7dcbebd59a7d","entry":"create_tree","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/Tree.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/Tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"30db7dcbebd59a7d"}},{"code_sha256_prefix":"01dc66a58b01373e","entry":"cvm_distance","repo":"satyakisikdar/VRG","repo_kind":"official","path":"analyze_graphs.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/analyze_graphs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"01dc66a58b01373e"}},{"code_sha256_prefix":"01ef231f4f4a9937","entry":"external_orca","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/GCD.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/GCD.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"01ef231f4f4a9937"}},{"code_sha256_prefix":"f68b204caa8a5571","entry":"external_rage","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/GCD.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/GCD.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f68b204caa8a5571"}},{"code_sha256_prefix":"31a8eb32d035d87f","entry":"fast_bp","repo":"satyakisikdar/VRG","repo_kind":"official","path":"analyze_graphs.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/analyze_graphs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"31a8eb32d035d87f"}},{"code_sha256_prefix":"592a86cbae541df1","entry":"gamma_code","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/MDL.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/MDL.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"592a86cbae541df1"}},{"code_sha256_prefix":"61400a85a468407d","entry":"get_level_wise_mdl","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/analysis.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/analysis.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"61400a85a468407d"}},{"code_sha256_prefix":"3d86f6a248344f37","entry":"hop_plot","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/analysis.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/analysis.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3d86f6a248344f37"}},{"code_sha256_prefix":"33aa8259c70fd86e","entry":"lambda_dist","repo":"satyakisikdar/VRG","repo_kind":"official","path":"analyze_graphs.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/analyze_graphs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"33aa8259c70fd86e"}},{"code_sha256_prefix":"9f483f37cf2ee9c9","entry":"nbits","repo":"satyakisikdar/VRG","repo_kind":"official","path":"src/MDL.py","file_url":"https://github.com/satyakisikdar/VRG/blob/HEAD/src/MDL.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9f483f37cf2ee9c9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}