Techniques for digital entity correlation

Techniques for using digital entity correlation to generate a composite knowledge graph from constituent graphs. In an aspect, digital attribute values associated with primary entities may be encoded into primitives, e.g., using a multi-resolution encoding scheme. A pairs graph may be constructed, based on seed pairs calculated from correlating encoded primitives, and further expanded to include subjects and objects of the seed pairs, as well as pairs connected to relationship entities. A similarity metric is computed for each candidate pair to determine whether a match exists. The similarity metric may be based on summing a weighted landing probability over all primitives associated directly or indirectly with each candidate pair. By incorporating primitive matches from not only the candidate pair but also from pairs surrounding the candidate pair, entity matching may be efficiently implemented on a holistic basis.