提出新方法计算航空网络边重要性，提升复杂网络分析效率。
Compute the edge p-Laplacian centrality for air traffic network
- 将航空网络转为线图，用节点p-Laplacian替代边p-Laplacian计算
- 实验验证该方法在真实航空网络上可成功实现
- 适合关注交通网络关键路径分析的研究者
本文旨在计算航空交通网络中的边p-Laplacian中心性。由于直接计算边p-Laplacian中心性极为困难，我们通过将航空网络转换为线图（line graph），进而计算线图的节点p-Laplacian中心性，其结果等价于原网络的边p-Laplacian中心性。基于无归一化图p-Laplacian算子定义，包括图曲率算子（即无归一化图1-Laplacian算子），本文提出一种新型无归一化图(p-)拉普拉斯排序方法，并用于计算线图的节点p-Laplacian中心性。实验结果表明，该方法可在真实航空网络数据上成功实施。
原文摘要 · Abstract (English)
The problem that we would like to solve in this paper is to compute the edge p-Laplacian centrality for the air traffic network. In this problem, instead of computing the edge p-Laplacian centrality directly which is the very hard problem, we convert the air traffic network to the line graph. Finally, we will compute the node p-Laplacian centrality of the line graph which is equivalent to the edge p-Laplacian of the air traffic network. In this paper, the novel un-normalized graph (p-) Laplacian based ranking method will be developed based on the un-normalized graph p-Laplacian operator definitions such as the curvature operator of graph (i.e. the un-normalized graph 1-Laplacian operator) and will be used to compute the node p-Laplacian centrality of the line graph. The results from the experiments show that the un-normalized graph p-Laplacian ranking methods can be implemented successfully.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。