HW6 : lowest conductance subgraph

5 views

Skip to first unread message

unread,

Mar 28, 2012, 6:36:23 PM3/28/12

to machine-learning-with-large-d...@googlegroups.com

Hi all,

Is it possible for the lowest conductance subgraph to contain a vertex that has a zero PageRank value?

- Malcolm

unread,

Mar 28, 2012, 6:56:19 PM3/28/12

to machine-learning-with-large-d...@googlegroups.com

From what I understand, the sweep is done only over the nonzero elements in the p vector. Therefore, no, it is not possible.

unread,

Mar 28, 2012, 8:43:56 PM3/28/12

to machine-learning-with-large-d...@googlegroups.com

thanks!

Reply all

Reply to author

Forward

0 new messages