How do you calculate network density?

Divide the number of ties that exist by the number that could exist. For n people, the maximum is n(n−1)/2 undirected ties — so a 20-person network has 190 possible connections, and 38 actual ones give a density of 0.2. For your personal (ego) network, exclude yourself and measure what fraction of your contacts know each other.

Is a dense network good or bad?

Both, for different purposes. Coleman's research shows dense, closed networks generate trust, support and enforceable norms — ideal for raising families and weathering crises. Burt's research shows sparse networks spanning structural holes deliver better information, ideas and career outcomes. The practical answer is a barbell: a dense inner circle for resilience, plus deliberately diverse outer ties for reach.

What is network closure?

Closure describes a network where your contacts are connected to each other, closing the triangles around you. James Coleman argued closure is the engine of social capital: when people share mutual contacts, gossip enforces honesty, favors are repaid, and cooperation carries less risk. Its cost is redundancy — closed networks keep hearing the same information from the same world.

Network science

Network density

Network density is the share of possible connections in a network that actually exist. Dense networks breed trust; sparse ones carry novel information.

Part of the Endearist relationship glossary →

Network density measures how interconnected a network is: the number of ties that exist, divided by the number that could exist. In a group of 10 people, 45 pairwise connections are possible; if 9 of them are realized, density is 0.2. Applied to your personal network, density asks a simple question — how many of the people you know also know each other?

The measure is foundational in social network analysis (Wasserman and Faust's 1994 textbook treats it as one of the first properties to compute), but its interest is not mathematical. Density predicts how a network behaves. Dense networks — where everyone knows everyone — transmit information fast internally, enforce norms, and generate trust: James Coleman argued in 1988 that this 'closure' is precisely what makes social capital effective, because reputation has consequences when your contacts compare notes. Sparse networks do the opposite job: they reach into many separate worlds and import information the dense core would never hear.

Neither end is 'better'. A maximally dense network is an echo chamber with deep trust; a maximally sparse one is a rolodex with no community. The research consensus is that effective personal networks combine a dense core with sparse, far-reaching spokes.

How density is calculated — and what counts as high

For a network of n people, the maximum number of undirected ties is n(n−1)/2. Density is simply existing ties divided by that maximum, giving a value between 0 (nobody knows anybody) and 1 (a complete clique). For ego networks — the network around one person, which is what matters for personal relationship management — you typically exclude yourself and ask what fraction of your contacts know each other. Two regularities are worth knowing. First, density falls mechanically as networks grow: in a village of 50 everyone can know everyone, in a city of 50,000 they cannot, so comparing densities across very different network sizes is misleading. Second, real ego networks are 'lumpy' — density is high within clusters (your family is probably a near-clique) and near zero between them. That lumpiness is why a single average can hide the most important structural facts, and why analysts usually look at density per cluster plus the bridges between clusters.

Coleman vs. Burt: the closure–brokerage trade-off

The deepest debate in network sociology runs straight through density. Coleman's closure argument (1988) says dense networks create social capital: when your contacts know each other, obligations are enforceable, information about trustworthiness circulates, and cooperation becomes safe. Ronald Burt's structural-holes program says the opposite: his studies of managers found that compensation, promotions and good ideas concentrate among people whose networks are sparse — rich in connections to groups that do not otherwise touch. The resolution most scholars accept is that the two describe different goods. Closure produces trust, support and safety; brokerage produces information, opportunity and innovation. Which you need depends on the task: raising children and surviving crises reward closure, while finding jobs, customers and ideas rewards brokerage. For an individual the implication is architectural — keep your inner circle dense and your outer network deliberately spread across worlds, rather than letting every layer drift toward the same comfortable cluster.

Reading the density of your own network

A rough density audit takes twenty minutes and no software. List your 30 most important people, then for each pair you can think of, mark whether they know each other. You will see the clusters immediately — and, more usefully, the gaps. Questions worth asking: Does my emotional support all come from one dense cluster (a risk if that cluster is also my employer)? Which two clusters would benefit from an introduction I could make? Who is my only link into an entire world, and when did I last talk to them? Endearist's relationship mapping makes this audit a living view instead of a one-off exercise: because contacts carry tags for the circles they belong to and a record of who introduced whom, you can see your dense cores and your fragile single-thread bridges at a glance — privately, computed on your device, from data only you hold.

Frequently asked questions

How do you calculate network density?: Divide the number of ties that exist by the number that could exist. For n people, the maximum is n(n−1)/2 undirected ties — so a 20-person network has 190 possible connections, and 38 actual ones give a density of 0.2. For your personal (ego) network, exclude yourself and measure what fraction of your contacts know each other.
Is a dense network good or bad?: Both, for different purposes. Coleman's research shows dense, closed networks generate trust, support and enforceable norms — ideal for raising families and weathering crises. Burt's research shows sparse networks spanning structural holes deliver better information, ideas and career outcomes. The practical answer is a barbell: a dense inner circle for resilience, plus deliberately diverse outer ties for reach.
What is network closure?: Closure describes a network where your contacts are connected to each other, closing the triangles around you. James Coleman argued closure is the engine of social capital: when people share mutual contacts, gossip enforces honesty, favors are repaid, and cooperation carries less risk. Its cost is redundancy — closed networks keep hearing the same information from the same world.

Sources

Last updated: 2026-06-10

Tend relationships, not records.

Endearist is a local-first personal CRM. Free up to 25 contacts.

Start free