The topology of ignorance
Known unknowns versus unknown unknowns in RDF. They look very different.
A known unknown has a visible shape in your KG. It’s a node with no edges, a literal ‘null’ where a value should be. It’s a SPARQL query that returns nothing because the triple doesn’t exist yet. You know the gap is there and you can even query for it.
An unknown unknown on the other hand leaves no traces. It’s the drug-protein interaction your graph never modeled because nobody thought to look. It’s the relationship between two clusters that are each well-connected internally but are never bridged. The absence isn’t visible, only the expected density that isn’t there.
Why does this matter practically? Because most KG validation (SHACL, SPARQL constraints, cardinality checks) is built entirely around known unknowns. We check for what we expect to be present. But the highest-value discoveries in any knowledge graph (the unexpected connections, the missing links that change everything) live in unknown unknown territory. We have almost no tooling for finding them. We (only) have human experts and given time and attention, they detect it.
The complement graph, the structural holes, the density gradients at domain boundaries… these are the shapes of what we don’t know.
There are no centrality measures for something that ain’t there. One direction worth watching though is persistent homology. Borrowed from topological data analysis, it tracks voids in a graph as you vary a confidence or weight threshold. A hole that appears and disappears quickly is probably noise. A hole that persists across many thresholds is a stable absence. It’s a region of the graph that the data consistently fails to connect, no matter how you filter it. That’s a different kind of signal than anything SPARQL can surface.
Little known, little used, but a fascinating topic worth looking at.