SoftNet: A Package for the Analysis of Complex Networks
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 MAT...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/15/9/296 |
| _version_ | 1797492098546532352 |
|---|---|
| author | Caterina Fenu Lothar Reichel Giuseppe Rodriguez |
| author_facet | Caterina Fenu Lothar Reichel Giuseppe Rodriguez |
| author_sort | Caterina Fenu |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-10T00:57:44Z |
| format | Article |
| id | doaj.art-73aeedefe1184837a400f8d38c8f5a0b |
| institution | Directory Open Access Journal |
| issn | 1999-4893 |
| language | English |
| last_indexed | 2024-03-10T00:57:44Z |
| publishDate | 2022-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj.art-73aeedefe1184837a400f8d38c8f5a0b2023-11-23T14:39:53ZengMDPI AGAlgorithms1999-48932022-08-0115929610.3390/a15090296SoftNet: A Package for the Analysis of Complex NetworksCaterina Fenu0Lothar Reichel1Giuseppe Rodriguez2Department of Mathematics and Computer Science, University of Cagliari, Via Ospedale, 72, 09124 Cagliari, ItalyDepartment of Mathematical Sciences, Kent State University, Kent, OH 44242, USADepartment of Mathematics and Computer Science, University of Cagliari, Via Ospedale, 72, 09124 Cagliari, ItalyIdentifying 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.https://www.mdpi.com/1999-4893/15/9/296complex network analysiscentrality measurematrix functionLanczos algorithm |
| spellingShingle | Caterina Fenu Lothar Reichel Giuseppe Rodriguez SoftNet: A Package for the Analysis of Complex Networks Algorithms complex network analysis centrality measure matrix function Lanczos algorithm |
| title | SoftNet: A Package for the Analysis of Complex Networks |
| title_full | SoftNet: A Package for the Analysis of Complex Networks |
| title_fullStr | SoftNet: A Package for the Analysis of Complex Networks |
| title_full_unstemmed | SoftNet: A Package for the Analysis of Complex Networks |
| title_short | SoftNet: A Package for the Analysis of Complex Networks |
| title_sort | softnet a package for the analysis of complex networks |
| topic | complex network analysis centrality measure matrix function Lanczos algorithm |
| url | https://www.mdpi.com/1999-4893/15/9/296 |
| work_keys_str_mv | AT caterinafenu softnetapackagefortheanalysisofcomplexnetworks AT lotharreichel softnetapackagefortheanalysisofcomplexnetworks AT giusepperodriguez softnetapackagefortheanalysisofcomplexnetworks |