Re: [igraph] degree correlation

[Bernie Hogan]

Hi all, 

Just to chime in on this, and to reply to Moses, degree assortativity is not about a dependent or independent variable, but another way of assessing a form of degree centralisation in the graph. A negative degree assortativity suggests that high degree nodes link to low degree nodes, as is the case with routers on the web. Most human networks tend to have high positive assortativity, suggesting that "popular" people associate with other popular people. It is also indicative of a core-periphery structure. It is nice as a descriptive measure, but certainly insufficient in its own right. 

Take care,

BERNiE 

Dr Bernie Hogan

Research Fellow, Oxford Internet Institute

University of Oxford

http://www.oii.ox.ac.uk/people/hogan/

On 23 Dec 2011, at 12:59, Claudio Martella wrote:

Personally it is interesting when analyzing scale free graphs. For instance: are hubs connected to hubs?

On Friday, December 23, 2011, Moses Boudourides <address@hidden> wrote:
> OK. But then degree correlation is an independent variable with
> linking the dependent variable, right? For a moment, I thought the
> other way around. --M
>
> On Fri, Dec 23, 2011 at 1:26 PM, Minh Nguyen <address@hidden> wrote:
>> Hi Moses,
>>
>> On Fri, Dec 23, 2011 at 10:22 PM, Moses Boudourides
>> <address@hidden> wrote:
>>> Excuse my intrusion in this exchange but could you please explain to
>>> me why would one be interested in computing the correlation among
>>> vertices? I'm sure there is a reason that I'm missing. Thanks.
>>
>> A reason is to work out the mixing patterns in a nework:
>>
>> http://en.wikipedia.org/wiki/Assortative_mixing
>>
>> --
>> Regards,
>> Minh Van Nguyen
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>

--
   Claudio Martella
   address@hidden   
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help