Spectral Graph Theory for Weighted Digraphs

Authors

Alexander Zaitzeff, Brigham Young University
Jeffrey Humpherys, Brigham Young University

Keywords

spectral graph theory, weighted digraphs, directed graph

College

Physical and Mathematical Sciences

Department

Mathematics

Abstract

For digraphs weighted and unweighted, one important application is ranking: Given a directed graph, whether it be the Internet or a social network, which node (representing a web page or a person) is the most important? There are many different methods to find answer this question. A few are highest indegree, closeness centrality¹, betweeness centrality², eigenvector centrality, Katz Centrality³, and PageRank⁴. Our idea is to use sparsity, or the idea that in a network only has a few important nodes, to determine the ranking on a graph.

Recommended Citation

Zaitzeff, Alexander and Humpherys, Jeffrey (2016) "Spectral Graph Theory for Weighted Digraphs," Journal of Undergraduate Research: Vol. 2016: Iss. 1, Article 220.
Available at: https://scholarsarchive.byu.edu/jur/vol2016/iss1/220