[Top][All Lists]

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

Re: [igraph] igraph-help Digest, Vol 93, Issue 13

From: Tina Wey
Subject: Re: [igraph] igraph-help Digest, Vol 93, Issue 13
Date: Fri, 25 Apr 2014 10:40:45 -0700

Thank you, Gabor! I'll explore the options.


On Mon, Apr 21, 2014 at 9:00 AM, <address@hidden> wrote:

Message: 3
Date: Mon, 21 Apr 2014 07:22:34 -0400
From: G?bor Cs?rdi <address@hidden>
To: Help for igraph users <address@hidden>
Subject: Re: [igraph] Triad census for signed networks?
Content-Type: text/plain; charset="utf-8"

Hi, I don't think we have anything for this. You can submit a feature
request for it here: https://github.com/igraph/igraph/issues?state=open

Maybe you can use subgraph isomorphisms with colored edges as a workaround.
It might be tricky, because you have to consider automorphisms of the
signed triangle as well.


On Mon, Apr 21, 2014 at 2:45 AM, Tina Wey <address@hidden> wrote:

> Hello,
> Is there anything like triad.census() for signed networks? For example, I
> would like to count the number of triads with different +/- combinations in
> multiple networks.
> Thank you in advance for help and advice,
> Tina
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.nongnu.org/archive/html/igraph-help/attachments/20140421/72aa15b5/attachment.html>

reply via email to

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