Re: [igraph] Matching actors pairs

[Carlos Eduardo]

Hi Gabor,

Thanks for the answer!

Actually I could find what I wanted by proceeding with matrices comparison:
m1 <- get.adjacency(g)
m3 <- m1+m2
length(which(m3>1))
The length > 1 gave me the information to find a ratio with the amount of
relations of each network (e.g. 90% of relations between m1 and m2 are the
same).

I would appreciate an additional help once I am trying to set
"length(which(m3>1))" as edge and vertex attributes. To the edge and vertex
which "length(which(m3>1))" I would like to attach value 1. Do you know how
to proceed?

Best,
Cadu


-----Original Message-----
From: address@hidden
[mailto:address@hidden On Behalf Of
Gábor Csárdi
Sent: 17 January 2012 13:44
To: Help for igraph users
Subject: Re: [igraph] Matching actors pairs

If I understand you right, you want the intersection of the two graphs,
where the nodes are matched based on their names. Then you might be looking
for the graph.intersection.by.name() function.

This, however, is included only in the not yet release 0.6 version.
You can download that here:
http://code.google.com/p/igraph/downloads/list

Be careful, because this version (the R package only) is not compatible with
the previous versions. It numbers vertices and edges from 1 instead of 0.

Best,
G.

On Sun, Jan 15, 2012 at 6:48 PM, Carlos Eduardo <address@hidden> wrote:
> Hello,
>
>
>
> Before I had done a question (see email below). Just now I could 
> understand exactly what I need from Igraph!
>
>
>
> I have two networks.
>
>
>
> Network 1
>
> [0]  '2'  -- '5'
>
> [1]  '2'  -- '9'
>
> [2]  '4'  -- '13'
>
>
>
> Network 2
>
> [0]  '2'  -- '5'
>
> [1]  '2'  -- '9'
>
> [2]  '2'  -- '11'
>
> [3]  '2'  -- '20'
>
> [4]  '4'  -- '18'
>
>
>
> The id of the actors are the. So, seeing the example above, the 
> following actor pairs is matching:
>
> [0]  '2'  -- '5'
>
> [1]  '2'  -- '9'
>
>
>
> I would like to proceed with this matching. May anyone tell me if it 
> is possible and how to do? Also, is it possible do it using anyone 
> numerical id, but not the R_id?
>
>
>
> Thanks in advance,
>
> Cadu
>
>
>
>
>
> From: Carlos Eduardo [mailto:address@hidden
> Sent: 14 January 2012 11:32
> To: address@hidden
> Subject: Asking for advice about Igrafh resources applied to the 
> analysis of a network
>
>
>
> Hello,
>
>
>
> I am dealing with three relation sets of the same actors I will 
> explain ahead. Considering Igraph resources/tools, I am asking for 
> advice about which could be applied to improve this network analysis 
> (actually, I have one objective question, but further advice will be
welcome).
>
>
>
> Follow attached the image of these networks; the different node size 
> is related to the real size of the actors which are corporations.
>
>
>
> For each set I measured (1) density and (2) correlation between degree 
> and
> size:
>
>
>
> a) Competition Network: the actors mentioned who are their competitors.
>
> Density: 0.48
>
> Correlation degree x size: 0.54 (p-value = 0.01)
>
>
>
> b) Acting Network: the actors mentioned they know each other and 
> exchange some general resources or information.
>
> Density: 0.40
>
> Correlation degree x size: 0.76 (p-value = 5.2)
>
>
>
> c) Cooperation Network: the actors mentioned they effectively 
> cooperate with each other in a “real” network structure.
>
> Density: 0.19
>
> Correlation degree x size: 0.45 (p-value = 0.03)
>
>
>
> Considering correlation “degree x size”, it seems that in competition 
> and cooperation networks, with moderate intensity, the bigger the 
> actor, the bigger the likelihood of the competition and cooperation
behaviour.
>
>
>
> Considering density, it’s is clear that relations of competition are 
> bigger than the others. Besides, it is suggestive that much of the 
> cooperation network relations exist inside the other networks. I could 
> see (not actually
> calculate) that even being competitors, same actors “acting” or 
> “cooperating” with each other (e.g. there are relations between actors 
> B and T along the three networks). So, is there any measure that shows 
> what is the amount of these same actors who relations are (remain the 
> same) in the different networks?
>
>
>
> As I told before, besides this question, any further advice/suggestion 
> of analysis using Igraph resources will be welcome!
>
>
>
> Many thanks in advance,
>
> Cadu
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>



--
Gabor Csardi <address@hidden>     MTA KFKI RMKI

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