SoftNet: A Package for the Analysis of Complex Networks
-
Published:2022-08-23
Issue:9
Volume:15
Page:296
-
ISSN:1999-4893
-
Container-title:Algorithms
-
language:en
-
Short-container-title:Algorithms
Author:
Fenu CaterinaORCID,
Reichel LotharORCID,
Rodriguez GiuseppeORCID
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.
Funder
Regione Autonoma della Sardegna
Istituto Nazionale di Alta Matematica Francesco Severi
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference35 articles.
1. Evaluating scientific products by means of citation-based models: A first analysis and validation;Bini;Electron. Trans. Numer. Anal.,2008
2. The Structure of Complex Networks;Estrada,2012
3. Statistical-mechanical approach to subgraph centrality in complex networks
4. Networks: An Introduction;Newman,2010
5. Subgraph centrality in complex networks
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献