Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
{"title":"Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph","authors":"Neng-pin Lu","doi":"10.1080/0022250X.2018.1555827","DOIUrl":null,"url":null,"abstract":"ABSTRACT Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph.","PeriodicalId":50139,"journal":{"name":"Journal of Mathematical Sociology","volume":"43 1","pages":"164 - 178"},"PeriodicalIF":1.3000,"publicationDate":"2018-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0022250X.2018.1555827","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical Sociology","FirstCategoryId":"90","ListUrlMain":"https://doi.org/10.1080/0022250X.2018.1555827","RegionNum":4,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 2
Abstract
ABSTRACT Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph.
期刊介绍：
The goal of the Journal of Mathematical Sociology is to publish models and mathematical techniques that would likely be useful to professional sociologists. The Journal also welcomes papers of mutual interest to social scientists and other social and behavioral scientists, as well as papers by non-social scientists that may encourage fruitful connections between sociology and other disciplines. Reviews of new or developing areas of mathematics and mathematical modeling that may have significant applications in sociology will also be considered.
The Journal of Mathematical Sociology is published in association with the International Network for Social Network Analysis, the Japanese Association for Mathematical Sociology, the Mathematical Sociology Section of the American Sociological Association, and the Methodology Section of the American Sociological Association.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
