1. A method comprising: establishing a first entity and a second entity in an entity relationship graph, wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities; assigning an initial activation value to the first entity; creating an activation value distribution in the entity relationship graph by spreading the initial activation value assigned to the first entity to other entities in the entity relationship graph; determining an activation value at the second entity in the activation value distribution; determining a plurality of candidate path relationships between the first entity and the second entity, wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships; for each candidate path relationship in the plurality of candidate path relationships: determining a path type that is associated with a candidate path relationship; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user; and selecting, in the plurality of candidate path relationships, one candidate path relationship having a score value that satisfies one or more first criteria; wherein the plurality of candidate path relationships is identified as one or more path relationships whose contributions to the activation value at the second entity satisfy one or more second criteria; wherein the method is performed by one or more computing devices.
1. A method comprising: establishing a first entity and a second entity in an entity relationship graph, wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities; assigning an initial activation value to the first entity; creating an activation value distribution in the entity relationship graph by spreading the initial activation value assigned to the first entity to other entities in the entity relationship graph; determining an activation value at the second entity in the activation value distribution; determining a plurality of candidate path relationships between the first entity and the second entity, wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships; for each candidate path relationship in the plurality of candidate path relationships: determining a path type that is associated with a candidate path relationship; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user; and selecting, in the plurality of candidate path relationships, one candidate path relationship having a score value that satisfies one or more first criteria; wherein the plurality of candidate path relationships is identified as one or more path relationships whose contributions to the activation value at the second entity satisfy one or more second criteria; wherein the method is performed by one or more computing devices. 9. A method as recited in claim 1 , wherein the score value for the candidate path relationship includes a third measure that indicates how prestigious one or more entities along the candidate path are.