Social Network Analysis for Data Scientists (JM2080M6)
All documents for this subject (2)
Seller
Follow
tomdewildt
Reviews received
Content preview
1. Introduction
Network Science
It is an interdisciplinary, that uses input and addresses research questions from sociology,
economics, physics, biology, psychology, computer science, etc.
● Empirical (data-driven): differs from graph theory because tools and analysis are judged
by the substantive insights they offer
● Quantitative (mathematical & statistical): measuring how strong influence is and whether
it is statistically significant instead of whether there is a connection
Graph Theory
Study of how entities (nodes) are connected through edges or links.
Social Network
Any relationship between people that is interesting to study.
Complexity Science
The study of different effects on a variable. If relations between effects and variables become
too complex to explain it is called emergent.
2. Network Measures
Walk
Moving across a network adhering to the direction of the edges.
Path
A walk that never goes through the same edge (every path is a walk → but not every walk is a
path).
Length
The number of edges a path goes through.
Geodesic
The shortest path from 𝑖 to 𝑗.
Geodesic Length (Distance)
The minimum number of edges needed to move from 𝑖 to 𝑗.
Diameter
The longest distance across all pairs of nodes.
1
, Shortest Path
In a weighted graph the shortest path from 𝑖 to 𝑗 is the path that has the smallest possible sum
of weights among all possible paths from 𝑖 to 𝑗.
Cycle
A closed loop of edges with all arrows pointing the same way around the loop.
Weighted Network
A network where the edges are not binary but have a numeric value (i.e. the average number of
times two people talk to each other).
Multiplex (Multilayer) Network
A network where multiple kinds of edges are possible between nodes (i.e. two people being
connected by friendship, trust, coworkership, advice-sharing, etc.).
Bipartite Network
A network that contains two kinds of vertices and edges only go between the different types of
vertices (i.e. students and courses).
Multipartite Network
A network that can be collapsed/projected to a lower structure (i.e. co-authorship).
Small World
The concept where many people have low numbers of connections and few people have a high
number of connections (hubs). By traveling through these hubs it’s possible to jump through the
network.
Transitivity
Look at each set of 3 vertices that have a path of length 2 (open triad) and count the proportion
of them that form a full cycle (closed triad).
● 1: implies perfect transitivity
● 0: implies no closed triads
𝑛𝑜. 𝑐𝑙𝑜𝑠𝑒𝑑 𝑡𝑟𝑖𝑎𝑑𝑠
𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑖𝑡𝑦 = 𝑛𝑜. 𝑝𝑎𝑡ℎ𝑠 𝑜𝑓 𝑙𝑒𝑛𝑔𝑡ℎ 2
Transitivity: 0.6 (3 out of 5)
● y-x-z: closed
● y-z-x: closed
● x-yz-: closed
● w-z-y: open
● w-z-x: open
2
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller tomdewildt. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $5.89. You're not tied to anything after your purchase.