Estrada, Ernesto and Higham, Desmond (2010) Network properties revealed through matrix functions. SIAM Review, 52 (4). pp. 696-714.Full text not available in this repository. (Request a copy from the Strathclyde author)
The emerging field of network science deals with the tasks of modeling, comparing, and summarizing large data sets that describe complex interactions. Because pairwise affinity data can be stored in a two-dimensional array, graph theory and applied linear algebra provide extremely useful tools. Here, we focus on the general concepts of centrality, communicability, and betweenness, each of which quantifies important features in a network. Some recent work in the mathematical physics literature has shown that the exponential of a network's adjacency matrix can be used as the basis for defining and computing specific versions of these measures. We introduce here a general class of measures based on matrix functions, and show that a particular case involving a matrix resolvent arises naturally from graph-theoretic arguments. We also point out connections between these measures and the quantities typically computed when spectral methods are used for data mining tasks such as clustering and ordering. We finish with computational examples showing the new matrix resolvent version applied to real networks.
|Keywords:||centrality measures, clustering methods, communicability, Estrada index, Fiedler vector, graph Laplacian, graph spectrum, power series, resolvent, Probabilities. Mathematical statistics, Computational Mathematics, Theoretical Computer Science, Applied Mathematics|
|Subjects:||Science > Mathematics > Probabilities. Mathematical statistics|
|Department:||Faculty of Science > Mathematics and Statistics|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Mar 2011 14:28|
|Last modified:||24 Feb 2017 04:53|