Thank you, Gabor! I'll explore the options. Cheers, Tina
On Mon, Apr 21, 2014 at 9:00 AM, <[email protected]> wrote: > > Message: 3 > Date: Mon, 21 Apr 2014 07:22:34 -0400 > From: G?bor Cs?rdi <[email protected]> > To: Help for igraph users <[email protected]> > Subject: Re: [igraph] Triad census for signed networks? > Message-ID: > <CABtg= > [email protected]> > 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. > > Gabor > > > On Mon, Apr 21, 2014 at 2:45 AM, Tina Wey <[email protected]> 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 > > [email protected] > > 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 > > > > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
