[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Betweennes centrality (maximum and normalization)
From: |
Stefan Kroeger |
Subject: |
Re: [igraph] Betweennes centrality (maximum and normalization) |
Date: |
Thu, 11 Feb 2010 09:40:12 +0100 |
User-agent: |
Mozilla/5.0 (X11; U; Linux x86_64; de; rv:1.9.1.5) Gecko/20091130 SUSE/3.0.0-1.1.1 Lightning/1.0b2pre Thunderbird/3.0 |
Thank you all for the good advises!
I'll read and learn (and apply).
Thanks
Stefan
Am 10.02.2010 18:33, schrieb Lin Freeman:
> Stefan,
> Go download #23 and/or @27 at:
> http://moreno.ss.uci.edu/pubs.html
> and read them.
> Lin Freeman
>
> On Wed, Feb 10, 2010 at 11:05 AM, Stefan Kroeger <address@hidden> wrote:
>> Hi,
>>
>> I hope it's okay to ask a pretty special question to betweenes
>> centrality (BC) and not directly related to igraph.
>>
>> (mention: I deal with the node-related BC in undirected graphs.)
>>
>> my two problems/questions are:
>> (i) Is the highest measure BC of network, also the theoretical hightest
>> reachable (maximum) BC for the graph?
>>
>> (ii) Is there a way to normalize the betweennes centrality measures to
>> be able to compare between different graph?
>>
>>
>> thanks a lot
>> Stefan
>>
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>>
>> --
>> This message has been scanned for viruses and
>> dangerous content by MailScanner, and is
>> believed to be clean.
>>
>>
>
>
>