6 citations · 14 across the 8 of their papers we have counts for
8 papers
SCHENO: Measuring Schema vs. Noise in Graphs
Justus Isaiah Hibshman, Adnan Hoq, Tim Weninger
Real-world data is typically a noisy manifestation of a core pattern (schema), and the purpose of data mining algorithms is to uncover that pattern, thereby splitting (i.e. decompo…
Dynamic Vertex Replacement Grammars
Daniel Gonzalez Cedre, Justus Isaiah Hibshman, Timothy La Fond +2
Context-free graph grammars have shown a remarkable ability to model structures in real-world relational data. However, graph grammars lack the ability to capture time-changing phe…
Inherent Limits on Topology-Based Link Prediction
Justus I. Hibshman, Tim Weninger
Link prediction systems (e.g. recommender systems) typically use graph topology as one of their main sources of information. However, automorphisms and related properties of graphs…
Ratio of Symmetries Between any two n-Node Graphs
Justus Isaiah Hibshman
Given any two graphs on the same vertex set, and , along with the difference between the two graphs $Δ= (E_1 \setminus E_2) \cup (E_2 \setminus E_1…
Higher Order Imprecise Probabilities and Statistical Testing
Justus Hibshman, Tim Weninger
We generalize standard credal set models for imprecise probabilities to include higher order credal sets -- confidences about confidences. In doing so, we specify how an agent's hi…
Joint Subgraph-to-Subgraph Transitions -- Generalizing Triadic Closure for Powerful and Interpretable Graph Modeling
Justus Hibshman, Daniel Gonzalez Cedre, Satyaki Sikdar +1
We generalize triadic closure, along with previous generalizations of triadic closure, under an intuitive umbrella generalization: the Subgraph-to-Subgraph Transition (SST). We pre…
Towards Interpretable Graph Modeling with Vertex Replacement Grammars
Justus Hibshman, Satyaki Sikdar, Tim Weninger
An enormous amount of real-world data exists in the form of graphs. Oftentimes, interesting patterns that describe the complex dynamics of these graphs are captured in the form of…
Modeling Graphs with Vertex Replacement Grammars
Satyaki Sikdar, Justus Hibshman, Tim Weninger
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 intersec…