基于距离的可达性指数

摘要：

本文试图开发一个合适的可达性指数的网络，每个环节都有一个值，这样一个较小的数字是首选，如距离，成本，或旅行时间。一个称为距离和的度量具有三个独立的特性：匿名性，适当选择的独立公理和优势保持，这要求距离任何其他节点不远的节点至少是可访问的。我们认为，在某些应用中，需要消除的独立性。因此，广义距离和，一个家庭的可达性指标，将建议。它是线性的，除了考虑顶点的距离外，还考虑顶点的可达性，并依赖于一个参数以控制其与距离和的偏差。广义距离和是匿名的，并且当其参数满足一个充分条件时满足优势保持。两个详细的例子表明，它的能力，以反映脆弱性的访问链接中断。

英文摘要：

The paper attempts to develop a suitable accessibility index for networks where each link has a value such that a smaller number is preferred like distance, cost, or travel time. A measure called distance sum is characterized by three independent properties: anonymity, an appropriately chosen independence axiom, and dominance preservation, which requires that a node not far to any other is at least as accessible. We argue for the need of eliminating the independence property in certain applications. Therefore generalized distance sum, a family of accessibility indices, will be suggested. It is linear, considers the accessibility of vertices besides their distances and depends on a parameter in order to control its deviation from distance sum. Generalized distance sum is anonymous and satisfies dominance preservation if its parameter meets a sufficient condition. Two detailed examples demonstrate its ability to reflect the vulnerability of accessibility to link disruptions.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。