Systems and Methods for Mapping Nodes of Disconnected Graphs

A non-transitory computer readable storage medium having computer-executable program instructions stored thereon, that are executable by a computer to cause steps comprising:

• identifying a subject node of a first graph comprising a set of nodes each corresponding to a physical entity having a physical geographic location and one or more node attributes associated therewith;
• filtering out nodes of a second graph that are unrelated to the subject node of the first graph to identify a first subset of candidate nodes, the second graph comprising a set of nodes each corresponding to a physical entity having a physical geographic location and one or more node attributes associated therewith;
• identifying one or more first level edge attributes associated with the subject node, the first level edge attributes characterizing a relationship between the subject node and first level nodes of the first graph adjacent to the subject node;
• and
• filtering out nodes of the first subset of candidate nodes having first level edge attributes that do not correspond to the one or more first level edge attributes associated with the subject node to identify a second subset of candidate nodes.

A system, comprising:

• a processor;
• a memory;
• and
• a mapping module stored on the memory, the mapping module configured to be executed by the processor to cause:
• identifying a subject node of a first graph comprising a set of nodes each corresponding to a physical entity having a physical geographic location and one or more node attributes associated therewith;
• filtering out nodes of a second graph that are unrelated to the subject node of the first graph to identify a first subset of candidate nodes, the second graph comprising a set of nodes each corresponding to a physical entity having a physical geographic location and one or more node attributes associated therewith;
• identifying one or more first level edge attributes associated with the subject node, the first level edge attributes characterizing a relationship between the subject node and first level nodes of the first graph adjacent to the subject node;
• and
• filtering out nodes of the first subset of candidate nodes having first level edge attributes that do not correspond to the one or more first level edge attributes associated with the subject node to identify a second subset of candidate nodes.