[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Question about assortativity
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Question about assortativity |
Date: |
Thu, 31 Mar 2011 14:06:49 -0400 |
Marcel,
igraph only works with discrete values, if you have continuous values,
then you can discretize them.
Best,
Gabor
On Wed, Mar 30, 2011 at 5:36 PM, Marcel Salathé
<address@hidden> wrote:
> Hi
>
> I've got a question about assortativity based on continuous values assigned
> to vertices (i.e. the assortativity function).
>
> I'm curious how vertices are assumed to be of the same value if values are
> continuous. I couldn't find anything in the documentation. Looking up
> Newman's paper (Mixing patterns in networks, p.5) I found the following "By
> analogy with the developments of Section II, we can define a quantity exy,
> which is the fraction of all edges in the network that join together vertices
> with values x and y for the age or other scalar variable of interest. The
> values x and y might be either discrete in nature (e.g., integers, such as
> age to the nearest year) or continuous (exact age), making exy either a
> matrix or a function of two continuous variables. Here, for simplicity, we
> concentrate on the discrete case, but generalization to the continuous case
> is straightforward."
>
> What function is igraph using to determine if two continuous values are of
> the same "type"?
>
> Thanks for clarification
> Marcel
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> MTA KFKI RMKI