The degree ratio ranking method for directed graphs |
| |
| Authors: | René van den Brink Agnieszka Rusinowska |
| |
| Institution: | 1. Department of Econometrics and Operations Research, Tinbergen Institute, VU University, De Boelelaan 1105, Amsterdam 1081 HV, the Netherlands;2. Paris School of Economics, Centre d’Economie de la Sorbonne, CNRS, Université Paris 1, 106-112 Bd de l’Hôpital, Paris Cedex 13 75647, France;1. Department of Mathematics, Technische Universität Kaiserslautern, 67663 Kaiserslautern, Germany;2. Department of Economics and Business, University of Catania, Catania 95129, Italy;3. CEG-IST, Instituto Superior Técnico, Universidade de Lisboa, 1049–001 Lisboa, Portugal;4. Portsmouth Business School, Centre of Operations Research and Logistics (CORL), University of Portsmouth, PO1 3DE Portsmouth, United Kingdom;1. Faculdade de Engenharia da Universidade do Porto, Portugal;2. Department of Sport Science and Wellness, University of Naples Parthenope, Italy;1. Technical University of Denmark, Produktionstorvet, building 424, room 225 DK-2800 Kgs. Lyngby, Denmark;2. DEI, University of Bologna, Viale Risorgimento 2, Bologna I-40136, Italy;1. Department of Industrial Engineering, School of Management, Hangzhou Dianzi University, Hangzhou, 310018, China;2. Department of Industrial Engineering, School of Management, Xi''an Jiaotong University, Xi''an, 710049, China |
| |
| Abstract: | One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node is ranked higher, the higher is its Copeland score. In this paper, we deal with an alternative method to rank nodes according to their out- and indegree, namely ranking the nodes according to their degree ratio, i.e. the outdegree divided by the indegree. To avoid dividing by zero, we add 1 to both the out- as well as indegree of every node. We provide an axiomatization of the ranking by degree ratio using a clone property, which says that the entrance of a clone or a copy (i.e. a node that is in some sense similar to the original node) does not change the ranking among the original nodes. We also provide a new axiomatization of the ranking by Copeland score using the same axioms except that this method satisfies a different clone property. Finally, we modify the ranking by degree ratio by taking only the out- and indegree, but by definition assume nodes with indegree zero to be ranked higher than nodes with positive indegree. We provide an axiomatization of this ranking method using yet another clone property and a maximal property. In this way, we can compare the three ranking methods by their clone property. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
