igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] Question about the clique percolation method


From: Gábor Csárdi
Subject: Re: [igraph] Question about the clique percolation method
Date: Mon, 18 Apr 2011 09:40:40 -0400

Frederik,

you try some runs with smaller networks and see how the function
scales with the number of vertices. I don't expect that you can run
this simple implementation on your networks, though. Please consider
using the implementation by the original authors of the algorithm
instead.

Best,
Gabor

On Sun, Apr 17, 2011 at 8:20 PM, Frederik Lang <address@hidden> wrote:
> Dear all,
>
> I am new to iGraph (running it in R) and have a question regarding the
> clique percolation function that I found here.
>
> I have tried the method on smaller networks (50vertices, 170edges) and it
> has worked fine but when I run it on larger network nothing happens. The
> network I am working with has around 100.000 vertices and 200.000 edges. On
> the website I referred to, it does say the the function is slow but I was
> wondering if being slow means that I just have to try and let it run for
> several hours (overnight) or if it is not possible to use the function on
> such large networks?
>
>
> Kind regards,
>
>
> Frederik
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI



reply via email to

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