13. An apparatus comprising: one or more processors; one or more computer-readable non-transitory storage media embodying instructions operable, when executed, cause one or more of the processors to: maintain one or more data stores storing a social graph comprising a plurality of nodes and a plurality of edges between the nodes, the nodes comprising user nodes corresponding to users of a social-networking system and concept nodes corresponding to concepts, each of the edges being associated with a similarity number that indicates an affinity between the nodes that the edge is between; determine a confidence score between a first one of the user nodes and a first one of the concept nodes based at least in part on one or more similarity numbers associated with one or more edges between the first one of the user nodes and the first one of the concept nodes in one or more hops between them on the social graph; and store the confidence score in the data stores.
13. An apparatus comprising: one or more processors; one or more computer-readable non-transitory storage media embodying instructions operable, when executed, cause one or more of the processors to: maintain one or more data stores storing a social graph comprising a plurality of nodes and a plurality of edges between the nodes, the nodes comprising user nodes corresponding to users of a social-networking system and concept nodes corresponding to concepts, each of the edges being associated with a similarity number that indicates an affinity between the nodes that the edge is between; determine a confidence score between a first one of the user nodes and a first one of the concept nodes based at least in part on one or more similarity numbers associated with one or more edges between the first one of the user nodes and the first one of the concept nodes in one or more hops between them on the social graph; and store the confidence score in the data stores. 14. The apparatus of claim 13 , wherein to determine the confidence score, the instructions are operable, when executed, cause one or more of the processors to perform on the social graph one or more random walks between the first one of the user nodes and the first one of the concept nodes.