activity
20162025
most citedGrowing Graphs with Hyperedge Replacement Graph Grammars

6 citations · 7 across the 4 of their papers we have counts for

collaborators

7 papers

cs.CL2025★ 1 cited

Citations and Trust in LLM Generated Responses

Yifan Ding, Matthew Facciani, Amrit Poudel +5

Question answering systems are rapidly advancing, but their opaque nature may impact user trust. We explored trust through an anti-monitoring framework, where trust is predicted to…

quant-ph2024

QuOp: A Quantum Operator Representation for Nodes

Andrew Vlasic, Salvador Aguinaga

We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competi…

cs.SI2018

Growing Better Graphs With Latent-Variable Probabilistic Graph Grammars

Xinyi Wang, Salvador Aguinaga, Tim Weninger +1

Recent work in graph models has found that probabilistic hyperedge replacement grammars (HRGs) can be extracted from graphs and used to generate new random graphs with graph proper…

cs.SI2018

Learning Hyperedge Replacement Grammars for Graph Generation

Salvador Aguinaga, David Chiang, Tim Weninger

The discovery and analysis of network patterns are central to the scientific enterprise. In the present work, we developed and evaluated a new approach that learns the building blo…

cs.SI2017

A Temporal Tree Decomposition for Generating Temporal Graphs

Corey Pennycuff, Salvador Aguinaga, Tim Weninger

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. Recent work at the intersection of formal language theory and graph th…

cs.SI2016★ 6 cited

Growing Graphs with Hyperedge Replacement Graph Grammars

Salvador Aguiñaga, Rodrigo Palacios, David Chiang +1

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 extrac…