tag:blogger.com,1999:blog-9749960.post7052819026778106910..comments2023-12-24T17:17:18.526+00:00Comments on Research on Search: Laplacian Kernel, Resistance Distance and Commute TimeDell Zhanghttp://www.blogger.com/profile/14810903698038676929noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-9749960.post-6310580303371052902009-04-15T17:26:00.000+01:002009-04-15T17:26:00.000+01:00Maybe what you need is the PageRank of the given g...Maybe what you need is the <A HREF="" REL="nofollow">PageRank</A> of the given graph's <A HREF="http://en.wikipedia.org/wiki/Line_graph" REL="nofollow">line graph</A>?Dell Zhanghttps://www.blogger.com/profile/14810903698038676929noreply@blogger.comtag:blogger.com,1999:blog-9749960.post-32087121746266641062009-04-15T16:04:00.000+01:002009-04-15T16:04:00.000+01:00As you seem aware about this topic, I would have l...As you seem aware about this topic, I would have like to know if you knew about the way to compute the average number of time an edge is visited when randomly walking a graph from a vertex to an other vertex in terms of elements of the pseudo inverse of the laplacian matrix of the graph.<br /><br />There are some results to compute commute time distance in terms of the pseudo inverse matrix so I guess there should be ways for my broblems.<br /><br />Thank you !Anonymousnoreply@blogger.com