[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Relative betweenness

**From**: |
Moses Boudourides |

**Subject**: |
Re: [igraph] Relative betweenness |

**Date**: |
Fri, 17 Aug 2012 12:59:34 +0300 |

Thanks, Tamas. Now, let me add something I've just discovered: the
case A = {u, v} (i.e., A is composed of 2 vertices) and B = V-A is
what Eric Kolaczyk calls co-betweenness (cf., Kolaczyk, E.D., Chua,
D.B., and Barthelemy, M. (2007). Group Betweenness and Co-Betweenness:
Inter-related Notions of Coalition Centrality. Social Networks, 31:3,
190-203, http://arxiv.org/abs/0709.3420v1). In his site
(http://math.bu.edu/people/kolaczyk/software.html), Eric gives a
software (in matlab) for computing group betweenness bounds based on
vertex co-betweenness.
Best,
--Moses
On Thu, Aug 16, 2012 at 10:32 PM, Tamás Nepusz <address@hidden> wrote:
>*> will be calculated. But I'm not sure whether and how I could get the*
>*> betweenness of A with regards to geodesics stemming from B. Any ideas?*
>
>* Your best bet is to get all the shortest paths from each of the vertices in B *
>* using get.all.shortest.paths and then count how many of these paths pass *
>* through A "manually". Note that there could be multiple geodesics originating *
>* in B and going to some other vertex v, and it can happen that _some_ of these *
>* paths pass through v and others do not; in this case, you have to add the *
>* appropriate fraction to A's betweenness score. This could be a bit tricky to *
>* get it right but not impossible.*
>
>* Best,*
>* Tamas*
>
>
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* https://lists.nongnu.org/mailman/listinfo/igraph-help*