Re: [igraph] Create graphs with specified modularity score

[Gábor Csárdi]

Hi Diederik,

it would be quite nice to have a method that could sample uniformly
from networks with given modularity. I think nobody found such a
method so far, and personally I doubt that they would find one soon.

Btw. don't forget that modularity is not the property of the network,
but of a given partition of a network. So if you want to generate
networks with given maximum modularity, that might be very difficult,
even just maximizing modularity is computationally difficult.

But maybe I am wrong.

Best,
Gabor

On Sat, Aug 7, 2010 at 8:46 PM, Diederik van Liere <address@hidden> wrote:
> Hi
>
> I am trying to come up with a method, preferably in igraph, to
> generate graphs that will have predefined modularity score. I would
> like to know if someone has an idea how to do this.
>
> Would you start with a large and dense network, the remove edges,
> compute modularity and then if it hits a predefined value store the
> graph, or would you start with an empty graph and edges and nodes?  or
> is there an even better way?
>
> or is it impossible?
>
> Best,
>
> Diederik
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM