igraph-help
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Reverse engineering affiliation networks


From: Tamas Nepusz
Subject: Re: [igraph] Reverse engineering affiliation networks
Date: Thu, 4 Jun 2015 23:51:01 +0200
User-agent: Mutt/1.5.23 (2014-03-12)

Hi,

This is not possible in general as it is easy to construct two networks which
result in the same affiliation network representation -- even if you use
weights to indicate the number of events attended jointly. For example, with
three people (A, B and C):

Case #1: A, B and C attended event E1.
Case #2: A and B attended event E1, A and C attended event E2, B and C attended
event E3.

In both cases, the affiliation network will be a triangle.

T.

On 06/04, Ahmed Abdeen Hamed wrote:
> Hello friends,
> 
> Say your original network was constructed from people and events. Now, an
> affiliation network is derived based on the notion of people who are going
> to the same event. If you have computed cliques from this affiliation
> network, can you link this clique back to the original event being
> attended? Any examples would be appreciated.
> 
> Sincerely,
> 
> -Ahmed

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


-- 
T.



reply via email to

[Prev in Thread] Current Thread [Next in Thread]