[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] random walks with directed edges
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] random walks with directed edges |
Date: |
Mon, 21 May 2012 11:43:33 +0200 |
Hello Simone,
The walktrap algorithm is not suitable for directed graphs (despite its
reliance on random walks). The authors of the walktrap algorithm conclude this
in their original paper:
"For directed ones (like the important case of the web graph), on the contrary,
the proofs we provided are not valid anymore, and random walks behave
significantly differently. Therefore, we also consider the directed case as an
interesting direction for further research."
http://arxiv.org/pdf/physics/0512106v1.pdf
Best,--
T.
On Monday, 21 May 2012 at 09:56, Simone Gabbriellini wrote:
> Hello list,
>
> is there the possibility to tell walktrap.community to take into
> account my network is directed?
>
> igraph 0.5.4
>
> best,
> Simone
>
> --
> Dr. Simone Gabbriellini
>
> DigitalBrains srl
> Amministratore
> Head R&D
>
> mobile: +39 3403975626
> mail: address@hidden (mailto:address@hidden)
>
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help
- [igraph] random walks with directed edges, Simone Gabbriellini, 2012/05/21
- Re: [igraph] random walks with directed edges,
Tamás Nepusz <=
- Re: [igraph] random walks with directed edges, Simone Gabbriellini, 2012/05/21
- Re: [igraph] random walks with directed edges, Tamás Nepusz, 2012/05/21
- Re: [igraph] random walks with directed edges, Simone Gabbriellini, 2012/05/21
- Re: [igraph] random walks with directed edges, Tamás Nepusz, 2012/05/23
- Re: [igraph] random walks with directed edges, Simone Gabbriellini, 2012/05/23
- Re: [igraph] random walks with directed edges, Tamás Nepusz, 2012/05/23