Mittag-Leffler functions and their applications in network science
arXiv:2103.12559 · doi:10.1137/21M1407276
Abstract
We describe a complete theory for walk-based centrality indices in complex networks defined in terms of Mittag-Leffler functions. This overarching theory includes as special cases well-known centrality measures like subgraph centrality and Katz centrality. The indices we introduce are parametrized by two numbers; by letting these vary, we show that Mittag-Leffler centralities interpolate between degree and eigenvector centrality, as well as between resolvent-based and exponential-based indices. We further discuss modeling and computational issues, and provide guidelines on parameter selection. The theory is then extended to the case of networks that evolve over time. Numerical experiments on synthetic and real-world networks are provided.
References in corpus (8)
- Temporal Networks
- Subgraph Centrality in Complex Networks
- Congestion and centrality in traffic flow on complex networks
- On the limiting behavior of parameter-dependent network centrality measures
- Computing the matrix Mittag-Leffler function with applications to fractional calculus
- Correlation Between Student Collaboration Network Centrality and Academic Performance
- Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease
- On the stability of network indices defined by means of matrix functions