Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

2006

Computer Sciences

University of Massachusetts Amherst

Centrality

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Using Structure Indices For Efficient Approximation Of Network Properties, Matthew J. Rattigan, Marc Maier, David Jensen Jan 2006

Using Structure Indices For Efficient Approximation Of Network Properties, Matthew J. Rattigan, Marc Maier, David Jensen

Computer Science Department Faculty Publication Series

Statistics on networks have become vital to the study of relational data drawn from areas including bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating many of the most important measures—such as betweenness centrality, closeness centrality, and graph diameter—requires identifying short paths in these networks. However, finding these short paths can be intractable for even moderate-size networks. We introduce the concept of a network structure index (NSI), a composition of (1) a set of annotations on every node in the network and (2) a function that uses the annotations to estimate graph distance between pairs of nodes. We present several varieties …