Team Operations
Social Network Analysis: Read a Business Network Without Overreading It
Learn social network analysis with a five-person worked example. Calculate degree and density, then see why an incomplete graph cannot establish trust or access.

What you will learn
- Describe people and connections as nodes and edges.
- Calculate degree and density for a specified simple graph.
- Recognize what an incomplete network cannot tell you.
Social network analysis studies patterns of relationships. It represents people or organizations as nodes and a specified kind of connection as edges. Used carefully, it can help you ask better questions about information flow, collaboration and coverage.
The important phrase is “a specified kind of connection.” A shared meeting, an email exchange and a close working relationship are not interchangeable. Decide what an edge means before calculating anything.
A complete small example
The following fictional network has five people: Asha, Ben, Cora, Devon and Eli. An undirected edge means both people confirmed a current working relationship. There are no self-connections and no duplicate edges.
- Asha is connected to Ben.
- Ben is connected to Cora.
- Ben is connected to Devon.
- Devon is connected to Eli.
These four edges are the entire example. A line represents a confirmed working connection in this exercise, not permission to request an introduction.
Degree in the fictional network
| Person | Direct neighbors | Degree |
|---|---|---|
| Asha | Ben | 1 |
| Ben | Asha, Cora, Devon | 3 |
| Cora | Ben | 1 |
| Devon | Ben, Eli | 2 |
| Eli | Devon | 1 |
What degree tells you
Degree is the number of direct edges touching a node. Ben has degree 3. The degree total is 1 + 3 + 1 + 2 + 1 = 8, which equals twice the four edges because each undirected edge touches two people.
Normalized degree centrality divides degree by the number of other possible nodes. With five people, Ben’s value is 3 / 4 = 0.75. NetworkX documents this normalization. The calculation describes this graph. It does not prove Ben is the most trusted, influential or willing person.
How to calculate network density
For a simple undirected graph, the number of possible edges is n × (n − 1) / 2. With five nodes, that is 5 × 4 / 2 = 10. Four observed edges divided by ten possible edges gives a density of 0.4, or 40%.
This matches the standard density formula: 2 × 4 / (5 × 4) = 0.4. Adding an Asha-to-Eli edge would make density 5 / 10 = 50%. That would be a mathematical change, not evidence of better business performance.
What about bridges and short paths?
In this example, removing the Ben-to-Devon edge separates the graph into two groups. It is a bridge in the graph-theoretic sense. A shortest path from Asha to Eli passes through Ben and Devon.
That path does not answer whether Ben knows Eli, whether Devon wants to help, or whether Eli is interested. A route in a model and a consented human introduction remain different things.
Use a boundary statement with any analysis
Write down the source, observation period, included people, edge definition and missing data. If you only reviewed one email source, do not label the result “our entire company network.” If you do not know whether an edge is current, mark that uncertainty.
Finta Networks can help you inspect relationship evidence. This lesson teaches manual analysis of a specified example; it does not claim Finta provides native graph-density or centrality calculations.
For a practical view of connections, read relationship mapping. For the meaning behind interaction signals, see how relationship intelligence works. A useful graph makes its limits as readable as its lines.