Re: [igraph] Dyadwise shared partners

[Simone Gabbriellini]

Gabor,

a few words just to be more specific...

I am trying to reproduce as close as I can the structure of the Sampson's monks 
network. I am working on the mechanism of selection between nodes in NetLogo - 
because I am used to it more than R.

I would like to use igraph for the computational intensive part regarding 
network analysis. If I get it right, DSP and ESP are considered to be two 
reliable measures for comparing the structural features of networks, besides 
degree distribution, shorthest path lenght and triad census.

many thanks,
Simone


Il giorno 28/giu/2010, alle ore 19.38, Gábor Csárdi ha scritto:

> OK, I think I understand it. But why do you specifically need this measure?
> 
> Gabor
> 
> On Sat, Jun 26, 2010 at 7:56 PM, Simone Gabbriellini
> <address@hidden> wrote:
>> and this is a definition I've found in the ergm package:
>> 
>> dsp(d):
>> 
>> Dyadwise shared partners: The d argument is a vector of distinct integers. 
>> This term adds one network statistic to the model for each element in d; the 
>> ith such statistic equals the number of dyads in the network with exactly 
>> d[i] shared partners. This term can be used with directed and undirected 
>> networks. For directed networks the count is over homogeneous shared 
>> partners only (i.e., only partners on a directed two-path connecting the 
>> nodes in the dyad).
>> 
>> I don't know if this can help you to understand the algorithm... it does not 
>> help me...
>> 
>> simone
>> 
>> Il giorno 26/giu/2010, alle ore 19.40, Gábor Csárdi ha scritto:
>> 
>>> Simone,
>>> 
>>> what is the formal definition of this measure?
>>> 
>>> Gabor
>>> 
>>> On Sat, Jun 26, 2010 at 4:46 PM, Simone Gabbriellini
>>> <address@hidden> wrote:
>>>> Hello list,
>>>> 
>>>> I would like to know if there is a dyadwise shared partners (or edgewise 
>>>> shared partners) algorithm in igraph, or, if you have notice of these 
>>>> statistics, some hint on how to implement them in igraph...
>>>> 
>>>> many thanks for any advice,
>>>> Simone Gabbriellini
>>>> _______________________________________________
>>>> igraph-help mailing list
>>>> address@hidden
>>>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>>>> 
>>> 
>>> 
>>> 
>>> --
>>> Gabor Csardi <address@hidden>     UNIL DGM
>>> 
>>> _______________________________________________
>>> igraph-help mailing list
>>> address@hidden
>>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>> 
>> 
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>> 
> 
> 
> 
> -- 
> Gabor Csardi <address@hidden>     UNIL DGM
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help