[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Edge symmetry

**From**: |
Tamas Nepusz |

**Subject**: |
Re: [igraph] Edge symmetry |

**Date**: |
Fri, 03 Feb 2012 16:11:16 +0100 |

**User-agent**: |
Mozilla/5.0 (X11; Linux x86_64; rv:9.0) Gecko/20111229 Thunderbird/9.0 |

Hi,
The function you are looking for is called "reciprocity", although it is
defined a bit differently: it is "the proportion of all possible (A, B)
pairs which are reciprocal, provided there is at least one edge between A
and B". So, in your case, the reciprocity is 1/3, since there are three
connected pairs (1-2, 1-3 and 3-2), and one of them is reciprocal.
I think this definition can be converted into yours using simple math if you
know the number of edges.
--
T.
On 02/03/2012 04:07 PM, Carlos Eduardo wrote:
>* Hi,*
>* *
>* *
>* *
>* Does Igraph have any command to calculate edge symmetry? For instance, to*
>* the edges bellow, [0] and [1] indicate an edge symmetry between vertex 1 and*
>* 2. So, considering all network edges, the mentioned edges indicate 50% of*
>* symmetry.*
>* *
>* *
>* *
>* [0] '1' -> '2'*
>* *
>* [1] '2' -> '1'*
>* *
>* [2] '1' -> '3'*
>* *
>* [3] '3' -> '2'*
>* *
>* *
>* *
>* Thanks in advance,*
>* *
>* Cadu*
>* *
>* *
>* *
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* https://lists.nongnu.org/mailman/listinfo/igraph-help*