This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Due midnight Friday, November 12 2010 CS224W: Social and Information Network Analysis Competition - Fall 2010 This competition must be done completely individually, but it is not mandatory. However, the five students with the highest scores will get extra credit: 10% for first place, 8% for the second place, 6% for the third, and 4% for fourth and fifth. In the case of ties, multiple students may receive the extra credit amount listed above for the given place. Clustering of Signed Graphs In this task your goal is to identify communities (coalitions) in a network with positive and negative edges. Note that you are not allowed to use any community detection software, but can use packages for general network analysis like Networkx, JUNG, and SNAP. Networks with signed edges were first addressed by structural balance theory. The structural balance considers the possible ways in which triangles on three individuals can be signed, and posits that triangles with three positive signs (three mutual friends) and those with one positive sign (two friends with a common enemy) are more plausible and hence should be more prevalent in real networks than triangles with two positive signs (two enemies with a common friend) or no positive signs (three mutual enemies). See Figure for an illustration. Balanced triangles with three positive edges exemplify the well-known principle that the friend of my friend is my friend, whereas those with one positive and two negative edges capture the notions that the friend of my enemy is my enemy, the enemy of my friend is my enemy, and the enemy of my enemy is my friend. The network is said to be balanced, if all triads in a network are balanced....
View Full Document
- Fall '09