Refinement of Metrics: Erdős Number, a Case Study
We introduce a concept called refinement and provide 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 of new versions of the Erdős number.
Copyright (c) 2019 Kayla Lock, Wai Yan Pong, Alexander Wittmond
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.