Name
Abstract | ||
|---|---|---|
Identifying the most important nodes according to specific centrality indices is an important issue in network analysis. Node metrics based on the computation of functions of the adjacency matrix of a network were defined by Estrada and his collaborators in various papers. This paper describes a MATLAB toolbox for computing such centrality indices using efficient numerical algorithms based on the connection between the Lanczos method and Gauss-type quadrature rules. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.3390/a15090296 | ALGORITHMS |
Keywords | DocType | Volume |
complex network analysis, centrality measure, matrix function, Lanczos algorithm | Journal | 15 |
Issue | ISSN | Citations |
9 | 1999-4893 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Caterina Fenu | 1 | 0 | 0.68 |
| Lothar Reichel | 2 | 453 | 95.02 |
| Giuseppe Rodriguez | 3 | 0 | 0.68 |