{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T15:42:30Z","timestamp":1740152550256,"version":"3.37.3"},"reference-count":35,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009873","name":"Regione Autonoma della Sardegna","doi-asserted-by":"publisher","award":["RASSR57257"],"id":[{"id":"10.13039\/501100009873","id-type":"DOI","asserted-by":"publisher"}]},{"name":"INdAM-GNCS"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"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.<\/jats:p>","DOI":"10.3390\/a15090296","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T01:05:12Z","timestamp":1661303112000},"page":"296","source":"Crossref","is-referenced-by-count":1,"title":["SoftNet: A Package for the Analysis of Complex Networks"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2831-0591","authenticated-orcid":false,"given":"Caterina","family":"Fenu","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Cagliari, Via Ospedale, 72, 09124 Cagliari, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-6816","authenticated-orcid":false,"given":"Lothar","family":"Reichel","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Kent State University, Kent, OH 44242, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9054-8712","authenticated-orcid":false,"given":"Giuseppe","family":"Rodriguez","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Cagliari, Via Ospedale, 72, 09124 Cagliari, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"Evaluating scientific products by means of citation-based models: A first analysis and validation","volume":"33","author":"Bini","year":"2008","journal-title":"Electron. Trans. Numer. Anal."},{"key":"ref_2","unstructured":"Estrada, E. (2012). The Structure of Complex Networks, Oxford University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cplett.2007.03.098","article-title":"Statistical-mechanical approach to subgraph centrality in complex networks","volume":"439","author":"Estrada","year":"2007","journal-title":"Chem. Phys. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J. (2010). Networks: An Introduction, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","article-title":"Subgraph centrality in complex networks","volume":"71","author":"Estrada","year":"2005","journal-title":"Phys. Rev. E"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","article-title":"Subgraph centrality and clustering in complex hyper-networks","volume":"364","author":"Estrada","year":"2006","journal-title":"Phys. A"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.physrep.2012.01.006","article-title":"The physics of communicability in complex networks","volume":"514","author":"Estrada","year":"2012","journal-title":"Phys. Rep."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"036111","DOI":"10.1103\/PhysRevE.77.036111","article-title":"Communicability in complex networks","volume":"77","author":"Estrada","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1137\/120886261","article-title":"Block Gauss and anti-Gauss quadrature with application to networks","volume":"34","author":"Fenu","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/comnet\/cnv016","article-title":"Matching exponential-based and resolvent-based centrality measures","volume":"4","author":"Aprahamian","year":"2016","journal-title":"J. Complex Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.laa.2010.03.035","article-title":"Quadrature rule-based bounds for functions of adjacency matrices","volume":"433","author":"Benzi","year":"2010","journal-title":"Linear Algebra Its Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3104","DOI":"10.1016\/j.cam.2010.02.003","article-title":"A combined approach for evaluating papers, authors and scientific journals","volume":"234","author":"Bini","year":"2010","journal-title":"J. Comput. Appl. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1093\/comnet\/cnt007","article-title":"Total communicability as a centrality measure","volume":"1","author":"Benzi","year":"2013","journal-title":"J. Complex Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","article-title":"Power and centrality: A family of measures","volume":"92","author":"Bonacich","year":"1987","journal-title":"Am. J. Sociol."},{"key":"ref_15","first-page":"337","article-title":"Mapping directed networks","volume":"37","author":"Crofts","year":"2010","journal-title":"Electron. Trans. Numer. Anal."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/15427951.2011.604284","article-title":"Googling the brain: Discovering hierarchical and asymmetric network structures, with applications in neuroscience","volume":"7","author":"Crofts","year":"2011","journal-title":"Internet Math."},{"key":"ref_17","first-page":"723","article-title":"Versatile weighting strategies for a citation-based research evaluation model","volume":"16","author":"Romani","year":"2009","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/090761070","article-title":"Network properties revealed through matrix functions","volume":"52","author":"Estrada","year":"2010","journal-title":"SIAM Rev."},{"key":"ref_19","first-page":"353","article-title":"Locally supported eigenvectors and matrices associated with connected and unweighted power-law graphs","volume":"39","author":"Henson","year":"2012","journal-title":"Electron. Trans. Numer. Anal."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"A2046","DOI":"10.1137\/130911123","article-title":"Network analysis via partial spectral factorization and Gauss quadrature","volume":"35","author":"Fenu","year":"2013","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/140976649","article-title":"PageRank beyond the web","volume":"57","author":"Gleich","year":"2015","journal-title":"SIAM Rev."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Langville, A.N., and Meyer, C.D. (2006). Google\u2019s Pagerank and Beyond: The Science of Search Engine Rankings, Princeton University Press.","DOI":"10.1515\/9781400830329"},{"key":"ref_23","unstructured":"Griffiths, D.F., and Watson, G.A. (1994). Matrices, Moments and Quadrature in Numerical Analysis, Longman."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Golub, G.H., and Meurant, G. (2010). Matrices, Moments and Quadrature with Applications, Princeton University Press.","DOI":"10.1515\/9781400833887"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1137\/S1064827501397949","article-title":"IRBL: An implicitly restarted block Lanczos method for large-scale Hermitian eigenproblems","volume":"24","author":"Baglama","year":"2003","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/838250.838257","article-title":"Algorithm 827: Irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix","volume":"29","author":"Baglama","year":"2003","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_27","unstructured":"Newman, M.E.J. (2022, June 28). Newman\u2019s Web Page. Available online: http:\/\/www-personal.umich.edu\/~mejn\/netdata\/."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality of protein networks","volume":"411","author":"Jeong","year":"2001","journal-title":"Nature"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1093\/nar\/gkg340","article-title":"Topological structure analysis of the protein\u2013protein interaction network in budding yeast","volume":"31","author":"Sun","year":"2003","journal-title":"Nucleic Acids Res."},{"key":"ref_30","unstructured":"Batagelj, V., and Mrvar, A. (2022, June 28). Pajek Datasets. Available online: http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","article-title":"The structure of scientific collaboration networks","volume":"98","author":"Newman","year":"2001","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., and Gummadi, K.P. (2009, January 17). On the evolution of user interaction in Facebook. Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN\u201909), Barcelona, Spain.","DOI":"10.1145\/1592665.1592675"},{"key":"ref_34","unstructured":"(2022, June 28). The Max Plank Institute for Software Systems Web Site. Available online: http:\/\/socialnetworks.mpi-sws.org\/data-wosn2009.html."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/1462173.1462175","article-title":"CONTEST: A controllable test matrix toolbox for MATLAB","volume":"35","author":"Taylor","year":"2009","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/296\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T09:50:53Z","timestamp":1722765053000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,23]]},"references-count":35,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["a15090296"],"URL":"https:\/\/doi.org\/10.3390\/a15090296","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,8,23]]}}}