Show simple item record

dc.contributor.author Hultgren, Nils
dc.date.accessioned 2011-05-20T12:07:49Z
dc.date.available 2011-05-20T12:07:49Z
dc.date.issued 2011-05-20
dc.identifier.uri http://hdl.handle.net/10161/3771
dc.description.abstract The purpose of this paper is to investigate methods for analyzing networks from an algebraic perspective. The main focus will be on the dominant eigenpair of the adjacency matrix representing a graph, as many different centrality measures for networks are cast in terms of eigenvalue problems. We will see how it is affected by small perturbations to the graph and also propose methods for estimating these changes. This analysis will be justified from the ground up, only assuming basic elements of linear algebra. en_US
dc.language.iso en_US en_US
dc.subject Centrality en_US
dc.subject Networks en_US
dc.subject Dynamical importance en_US
dc.title Centrality and Network Analysis: A Perturbative Approach to Dynamical Importance en_US
dc.department Mathematics en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record