# Compute the edge p-Laplacian centrality for air traffic network

arXiv: https://arxiv.org/abs/2512.14749 · HTML: https://mlsanity.com/paper/2512.14749/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 28 references that are in the map.
- First posted on arXiv 13 Dec 2025.

## Builds on (most cited first, 6 of 6)

- [Hypergraph based semi-supervised learning algorithms applied to speech recognition problem: a novel approach](https://mlsanity.com/paper/1810.12743/) (2018)
- [Noise-robust classification with hypergraph neural network](https://mlsanity.com/paper/2102.01934/) (2021)
- [Text classification problems via BERT embedding method and graph convolutional neural network](https://mlsanity.com/paper/2111.15379/) (2021)
- [Solve fraud detection problem by using graph based learning methods](https://mlsanity.com/paper/1908.11708/) (2019)
- [To Detect Irregular Trade Behaviors In Stock Market By Using Graph Based Ranking Methods](https://mlsanity.com/paper/1909.08964/) (2019)
- [Hypergraph Laplacian Eigenmaps and Face Recognition Problems](https://mlsanity.com/paper/2405.16748/) (2024)

## Abstract (arXiv)

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.