Computational Math Seminar: Geoff Sanders
Maximum Principles for Graph Eigenvectors
,Ìý
Date and time:Ìý
Tuesday, September 10, 2013 - 10:00am
³¢´Ç³¦²¹³Ù¾±´Ç²Ô:Ìý
GRVW Conference Room
´¡²ú²õ³Ù°ù²¹³¦³Ù:Ìý
Finding interesting features in scale-free graph data has become an important numerical linear algebra application.ÌýÌý Spectral methods can be used to expose certain types of topological community structure.ÌýÌý We prove maximal principles and decay rates for eigenvectors associated with adjacency and modularity matrices, and discuss the impact of these results.