Notes on the Second Eigenvalue of the Google Matrix
Abstract
If A is an n× n matrix whose n eigenvalues are ordered in terms of decreasing modules, |λ1 | ≥ |λ2| ≥ ... |λn|, it is often of interest to estimate |λ2||λ1|. If A is a row stochastic matrix (so λ1 = 1), one can use an old formula of R. L. Dobrushin to give a useful, explicit formula for |λ2|. The purpose of this note is to disseminate these known results more widely and to show how they imply, as a very special case, some recent theorems of Haveliwala and Kamvar about the second eigenvalue of the Google matrix.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.