Minor Points of R2 and R3

[notconfusing]

R2 Minor Points

(is there anything to even do here):

The new discussion of the bi-partite network random walker model was very clear. The method as discussed in the paper now is more aligned with the bipartite HITS algorithm; this corresponds to the eigenvector centrality of the two projections of the matrix (M^TM, MM^T). I'm not sure that I understood the beta parameter before. The analogous PageRank algorithm would be the version in which a jump from e to a would be allowed with nonzero probability, even with M_ea = 0.

Figure 5 is interesting, and it's a nice tie-in to Figure 3. It seems like this is partial identifiability for the parameters.

R3 Minor Points

• Some minor grammatical errors throughout that would benefit from a thorough copyediting pass (missing spaces, "two-node").

[notconfusing]

done in 36bb2717bc75122c05a931581cd384ca72352306