PageRank on a 1,300-Node Graph

Took the PageRank method from applied linear algebra off a 12-page textbook example and onto a real 1,300-node, 2,267-edge graph that is 30% dangling. Three solvers cross-validated to 5.7e-12, memory cut 417x with sparse CSR. Derived and verified two results the textbook version does not give: the true rank floor once dangling mass acts as a second teleporter, and 24-iteration convergence against the ~142 the damping factor implies.