[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Questions about walktrap.community

From: Wang, Jing
Subject: Re: [igraph] Questions about walktrap.community
Date: Fri, 28 Oct 2011 09:31:42 -0500
User-agent: Microsoft-MacOutlook/

Dear Tamas,

        Thank you very much for your help!


On 10/28/11 5:53 AM, "Tamas Nepusz" <address@hidden> wrote:

>> I have two questions about walktrap.community. The first question is
>> there is a method to change the result of walktrap.community to a
>> class.
>I'm not an expert in the R interface so I cannot answer this question --
>maybe someone else on this list can.
>> The second question is where I can get the random walker adjcent
>> matrix used in the walktrap.community.
>I guess that you can obtain it fairly easily from the adjacency matrix:
>g <- graph.tree(4, 3, mode="undirected")
>rw <- Diagonal(x=1/degree(g)) %*% get.adjacency(g, sparse=F)
>> myself, could you please help me to make sure the following algorithm:
>For the walktrap community algorithm, we use exactly the same code as the
>original authors have published, so I guess it should be identical to the
>method they described in the paper.
>igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]