Mittag--Leffler Functions and their Applications in Network Science
From MaRDI portal
Publication:5014163
DOI10.1137/21M1407276zbMath1490.33007arXiv2103.12559MaRDI QIDQ5014163
Fabio Durastante, Francesca Arrigo
Publication date: 1 December 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12559
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mittag-Leffler functions and generalizations (33E12)
Related Items
The many facets of the Estrada indices of graphs and networks ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ A stochastic method for solving time-fractional differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Accounting for the role of long walks on networks via a new matrix function
- Computing the matrix Mittag-Leffler function with applications to fractional calculus
- On the exponential generating function for non-backtracking walks
- Generalized walks-based centrality measures for complex biological networks
- Ranking hubs and authorities using matrix functions
- Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease
- Analysis of directed networks via the matrix exponential
- A new status index derived from sociometric analysis
- Edge Modification Criteria for Enhancing the Communicability of Digraphs
- Matrix Inverse Trigonometric and Inverse Hyperbolic Functions: Theory and Algorithms
- The university of Florida sparse matrix collection
- Network Properties Revealed through Matrix Functions
- On the Convergence of Krylov Subspace Methods for Matrix Mittag–Leffler Functions
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- Computation of Generalized Matrix Functions
- On generalized matrix functions
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Bigraphs versus digraphs via matrices
- Networks
- On the Stability of Network Indices Defined by Means of Matrix Functions
- The restarted shift-and-invert Krylov method for matrix functions
- Axioms for Centrality
- Beyond non-backtracking: non-cycling network centrality measures
- Non-Backtracking Alternating Walks
- On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
- A Formula for the Fréchet Derivative of a Generalized Matrix Function
- A dynamical systems view of network centrality
- Low-Rank Updates of Matrix Functions
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Functions of Matrices
- Mittag-Leffler Functions, Related Topics and Applications
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- Graphs and matrices
