Social Networks: a Basic Introduction in Less Than 3 Minutes

Social Networks: A Basic Introduction in Four Minutes
1. Two Elements in Networks
Tie: Ties represent relations between nodes
Node: Nodes represent things that relate somehow to one another
2. Two Kinds of Networks
Directed Networks: Networks in which the tie has direction (AKA "digraphs"). Examples: hitting, kissing, infecting, sending letters.
Undirected Networks: Networks in which the tie has no direction. Examples: playing tennis with, married to, codefendant
3. Distance: "Geodesic" (Shortest Path)
4. Network Density
Directed Networks: # actual ties / (n*(n-1))
Undirected Networks: # actual ties / (n*(n-1))/2
where n=# of nodes
4. Closeness Centrality:
= 1/Farness
Farness: Sum of Distance to all other Nodes
5. Degree centrality: how many ties touch a node?
6. Betweenness Centrality for Node X:
Sum for all pairS of nodes (of the fraction of geodesics between A pair of nodes that have Node X in the middle)
7. Ego Networks
Level 1.0: Ego's Ties to Alters
Level 1.5: Level 1.0 Plus Alters' Ties to Other Alters
Level 2.0: Level 1.5 Plus Alters' Ties to Alters' Alters
8. Induced Homophily:
A tendency for ties to form to similar others because similar others are especially present in the social environment (group, community, society)
Example: No wonder blues are mostly tied to blues... there are hardly any reds out there!
9. Choice Homophily:
A tendency to choose to form ties with similar others even when different others are available in the social environment (group, community, society)
Lots of blues and lots of reds out there, Yet each is mostly tied to its own kind!
10. Kozo Sugiyama's Network Design Principles in the abstract
• Ties should be easy to follow from node to node
• Ties should be far from one another
• Ties should not cross or touch
• Ties should be straight
• Nodes that connect should be close
• Similar nodes should be close
• Central nodes should be in the center
Sugiyama, Kozo. 2002. Graph Drawing and Applications for Software and Knowledge Engineers. Singapore: World Publishing Company Inc.
That's easy to do in small, abstract networks...
... but large, real-world networks pose a challenge.
11. Looking for elaboration?
Looking for explanation?
Looking for application?
Looking for more?
Check out bit.ly/1M4RBEE
Undergraduate Social Networks at uma.edu

[@shravankumarbolisetty3236]

Dr.Cook, Its a great explanation . It helped me a lot .

[@joycelau5903]

Hi! I am a bit not very understand, how about the pair of EAF, FAE and EFA? need to count those pair (in the fraction with A in the middle's slide)?

[@JamesCookUMA]

+Joyce Lau Hi, Joyce. Those aren't geodesics. Geodesics are the shortest path. The shortest path from E to F is E-F. The shortest path from E to A is E-A.

[@raesah9519]

Dr. Cook. Do you have explanation on how to interpret the meaning numbers form UCINET 6?

[@marcoslvsfilho]

Hi! You might want to check Robert A. Hanneman and Mark Riddle "Introduction to social network methods". Chapter 18, specifically.
It's available online:
www.faculty.ucr.edu/~hanneman/nettext/

[@beejaygirl]

Dr. Cook, I am new to this and want to learn. How do I organize my data in Excel or some other form to show an ego network analysis?

[@JamesCookUMA]

Lots of different ways; in Excel, the most efficient way to do so would be using an edge list:
A-B
A-C
B-C
and so on. The two nodes in each tie would be each placed in a column (Tie 1, Tie 2), and each tie would have its own row.