Re: [igraph] about triangle transitivity

[Moses Boudourides]

Well, another option would be to use the formulas for the powers of
the adjacency matrix, although it might involve some work to derive
the corresponding expressions for 5-cycles and higher. I'm not sure,
this might have been already done in graph theory. If I was attempting
to do it, I would start from counting redundancies as in the
fundamental paper of Harary & Ross (Psychometrica, 1952).

--Moses

On Thu, Jan 12, 2012 at 4:00 PM, Gábor Csárdi <address@hidden> wrote:
> Hi,
>
> graph.motifs() (in R) supports motifs of size 3 and 4 currently. There
> is not much more code needed to support larger motifs, but these are
> not implemented yet.
>
> If you are looking for a specific motif, then you can also use the
> graph.count.subisomorphisms.vf2() function.
>
> G.
>
> On Thu, Jan 12, 2012 at 4:53 AM, gunce orman <address@hidden> wrote:
>> Hello,
>>
>> Transitivity only measures the number of triangles in a network.  But there
>> are other short cycles (e.g., 4-cycles) which are common in networks. Are we
>> able to calculate those types of 4- and more cycles as well as counting
>> triangles in igraph.
>>
>> Thank you
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>>
>
>
>
> --
> Gabor Csardi <address@hidden>     MTA KFKI RMKI
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help