The distance between two people/nodes in a collaboration graph is called the collaboration distance. Thus the collaboration distance between two distinct nodes is equal to the smallest number of edges in an edge-path connecting them. If no path connecting two nodes in a collaboration graph exists, the collaboration distance between them is said to be infinite.
The collaboration distance may be used, for instance, for evaluating the citations of an author, a group of authors or a journal.
In the collaboration graph of mathematicians, the collaboration distance from a particular person to Paul Erdős is called the Erdős number of that person. MathSciNet has a free online tool for computing the collaboration distance between any two mathematicians as well as the Erdős number of a mathematician. This tool also shows the actual chain of co-authors that realizes the collaboration distance.
For the Hollywood graph, an analog of the Erdős number, called the Bacon number, has also been considered, which measures the collaboration distance to Kevin Bacon.
Read more about this topic: Collaboration Graph
Famous quotes containing the word distance:
“The particular source of frustration of women observing their own self-study and measuring their worth as women by the distance they kept from men necessitated that a distance be kept, and so what vindicated them also poured fuel on the furnace of their rage. One delight presumed another dissatisfaction, but their hatefulness confessed to their own lack of power to please. They hated men because they needed husbands, and they loathed the men they chased away for going.”
—Alexander Theroux (b. 1940)