A method comprising: analyzing a social graph to identify one or more connection paths (70, 80) connecting a node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing a first entity associated with a message sender with a node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing a second entity specified by the message sender as a message recipient, the social graph represented by a graph data structure having nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing various entities and edges (34, 54, 56, 58, 60, 62) representing associations between entities, each edge (34, 54, 56, 58, 60, 62) connecting two nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) included in a connection path (70, 80) assigned an edge score representing an estimated strength of connection between two entities represented by the two nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120); deriving a path score for each of the one or more connection paths (70, 80) connecting the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the first entity with the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the second entity by aggregating edge scores of the edges (34, 54, 56, 58, 60, 62) in each individual connection path (70, 80), wherein deriving the path score includes selecting a scoring algorithm for use in deriving the path score, the scoring algorithm selected to correspond with an implied or explicitly defined type of electronic message to be communicated to the message recipient; generating a visual representation of at least one of the one or more connection paths (70, 80) connecting the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the first entity with the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the second entity; and presenting the visual representation of the one or more connection paths (70, 80). analyzing a social graph to identify one or more connection paths (70, 80) connecting a node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing a first entity associated with a message sender with a node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing a second entity specified by the message sender as a message recipient, the social graph represented by a graph data structure having nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing various entities and edges (34, 54, 56, 58, 60, 62) representing associations between entities, each edge (34, 54, 56, 58, 60, 62) connecting two nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) included in a connection path (70, 80) assigned an edge score representing an estimated strength of connection between two entities represented by the two nodes (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120); deriving a path score for each of the one or more connection paths (70, 80) connecting the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the first entity with the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the second entity by aggregating edge scores of the edges (34, 54, 56, 58, 60, 62) in each individual connection path (70, 80), wherein deriving the path score includes selecting a scoring algorithm for use in deriving the path score, the scoring algorithm selected to correspond with an implied or explicitly defined type of electronic message to be communicated to the message recipient; generating a visual representation of at least one of the one or more connection paths (70, 80) connecting the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the first entity with the node (32, 36, 42, 44, 46, 48, 50, 52, 72, 74, 76, 82, 84, 86, 88, 92, 94, 96, 98, 106, 108, 110, 112, 114, 122, 120) representing the second entity; and presenting the visual representation of the one or more connection paths (70, 80).