Refinement of Metrics: Erdős Number, a Case Study
arXiv:1908.11681
Abstract
We introduce a concept called refinement and develop two different ways of refining metrics. By applying these methods we produce several refinements of the shortest-path distance on the collaboration graph and hence a couple new versions of the Erdős number.
13 pages, 3 figures, 2 tables