Hidden Ancestor Graphs: Models for Detagging Property Graphs
R. W. R. Darling, Gregory S. Clark, J. D. Tucker

TL;DR
This paper introduces Hidden Ancestor Graphs, a model for classifying vertices as wild or tame based on neighborhood data, capturing complex network features like clustering and heavy-tailed degrees.
Contribution
It presents a novel generative model for graphs with hidden states, enabling classification and analysis of conflict and agreement edges in complex networks.
Findings
Model captures high clustering and heavy-tailed degree distributions.
Fitted using measurable graph parameters.
Provides a statistical classifier for wild vs. tame vertices.
Abstract
Consider a graph where each vertex is visibly labelled as a member of a distinct class, but also has a hidden binary state: wild or tame. Edges with end points in the same class are called agreement edges. Premise: an edge connecting vertices in different classes -- a conflict edge -- is allowed only when at least one end point is wild. Interpret wild status as readiness to form connections with any other vertex, regardless of class -- a form of class disaffiliation. The learning goal is to classify each vertex as wild or tame using its neighborhood data. In applications such as communications metadata, bio-informatics, retailing, or bibliography, adjacency in is typically created by paths of length two in a transactional bipartite graph . Class labelling, imported from a reference data source, is typically assortative, so agreement edges predominate. Conflict edges represent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Topological and Geometric Data Analysis · Bayesian Modeling and Causal Inference
