[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Clique Percolation Algorithm
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] Clique Percolation Algorithm |
Date: |
Thu, 5 Dec 2013 20:11:05 +0100 |
Hi Ethan
I think one of the reasons why the quick-and-dirty solution of the clique
percolation method as found on the wiki is slow is because it works by finding
all cliques of size k and then doing pairwise intersections on them. One other
possibility is to find all _maximal_ cliques instead and check whether any
clique pair has an intersection whose size is at least k-1. This is supposed to
be faster, especially if the gap between k and the clique number of your graph
is large.
--
T.
On Thursday, 5 December 2013 at 20:07, EthanK Gough wrote:
> Hi Csardi
>
> Do you have plans to add a clique percolation function to the igraph package?
>
> I tried the "quick (and rather inefficient)" function provided on the igraph
> wikidot page: http://igraph.wikidot.com/community-detection-in-r. However, it
> is indeed very slow.
>
> I'm just curious if there are any plans to add this functionality to igraph
> and to improve on it.
>
> thanks!
>
>
> On Wed, Dec 4, 2013 at 10:14 AM, EthanK Gough <address@hidden
> (mailto:address@hidden)> wrote:
> > Hi Gabor
> >
> > I have another quick question. So if the edge weights are added when
> > calculating the lengths of paths, does that mean then that a path with
> > larger edge weights is longer than one with smaller edge weights?
> >
> > thanks
> >
> > Ethan
> >
> >
> > On Mon, Nov 25, 2013 at 12:25 PM, Gábor Csárdi <address@hidden
> > (mailto:address@hidden)> wrote:
> > > On Mon, Nov 25, 2013 at 3:12 PM, EthanK Gough <address@hidden
> > > (mailto:address@hidden)> wrote:
> > > > How does igraph handle edge weights when using edge.betweenness and
> > > > shortest.paths? Does it simply add the edge weights when calculating the
> > > > lengths of paths and finding geodesics?
> > >
> > >
> > > It does exactly that.
> > >
> > > Gabor
> > >
> > > > Thanks
> > > >
> > > > Ethan
> > > >
> > > > _______________________________________________
> > > > igraph-help mailing list
> > > > address@hidden (mailto:address@hidden)
> > > > https://lists.nongnu.org/mailman/listinfo/igraph-help
> > >
> >
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help