Centrality and Network Analysis: A Perturbative Approach to Dynamical Importance
Repository Usage Stats
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 diﬀerent centrality measures for networks are cast in terms of eigenvalue problems. We will see how it is aﬀected by small perturbations to the graph and also propose methods for estimating these changes. This analysis will be justiﬁed from the ground up, only assuming basic elements of linear algebra.
CitationHultgren, Nils (2011). Centrality and Network Analysis: A Perturbative Approach to Dynamical Importance. Honors thesis, Duke University. Retrieved from https://hdl.handle.net/10161/3771.
More InfoShow full item record
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 United States License.
Rights for Collection: Undergraduate Honors Theses and Student papers