Keep the network.
Connections and people stay fixed.
Some people have more ways into a sample.
INSTRUMENTS / NETWORKS & PERCEPTION
Constructed exampleChange the network. Change the view.
Change an input. Inspect every step. Keep a fixed record.
01 / THE QUESTION
Who is most likely to appear in your sample?
The opening star has eight people. One person has seven connections; each of the others has one. What changes when we enter through a connection instead of choosing a person?
Keep a first thought
Optional. Included only when you explicitly save; excluded from shared links.
Constructed data · every relationship and outcome is supplied.
02 / OPEN THE MODEL
Edit people and connections
An undirected connection counts once. Applying a valid draft updates the model. Removing a person also removes their connections.
CHANCE OF SELECTING EACH PERSON
One person, uniformly selected. Bars use a 0–100% scale.
A1/8
B1/8
C1/8
D1/8
E1/8
F1/8
G1/8
H1/8
1.75Uniform person meanconnections
4Uniform edge-end meanconnections
7Undirected connectionsedges
Follow the idea.
A concept, in three framesChange the entry point.
A person and an edge-end are different samples.
Compare the weights.
More connections create more ways to be reached.
HOLD ONE VERSION STILL
What changes when you change the model?
Keep the current inputs beside your next adjustment.
The way you sample changes the world you see.
Choosing a person uniformly gives everyone equal weight. Choosing an edge uniformly, then one of its ends uniformly, weights each person by their number of connections.
Save this experiment
MODEL & LIMITS
What this model leaves open
These are two exact sampling procedures on a supplied graph. They do not show that every person has fewer connections than their contacts, or measure friendship quality.
- InputsWhat is supplied?
- DefinitionWhat is counted?
- InferenceWhat follows?
Inspect the exact workings
Sum of degrees = 14 = 2 × 7 edges. Sum of squared degrees = 56. Person mean = 14/8 = 1.75. Endpoint mean = 56/14 = 4.
| Person | Neighbors | Degree | Person weight | Edge-end weight |
|---|---|---|---|---|
| A | B, C, D, E, F, G, H | 7 | 1/8 | 7/14 |
| B | A | 1 | 1/8 | 1/14 |
| C | A | 1 | 1/8 | 1/14 |
| D | A | 1 | 1/8 | 1/14 |
| E | A | 1 | 1/8 | 1/14 |
| F | A | 1 | 1/8 | 1/14 |
| G | A | 1 | 1/8 | 1/14 |
| H | A | 1 | 1/8 | 1/14 |
Connections: A—B, A—C, A—D, A—E, A—F, A—G, A—H. For a nonempty edge set, the two means differ by degree variance divided by mean degree. Equality holds when every person has the same degree.
Assumptions, sources and evidence status
Original constructed fixture: constructed-networks-v1. networks-v1. No empirical observations are represented by these example counts.
- Uniform edge-end sampling is not uniform-person-then-neighbor sampling.
- An edgeless graph has no endpoint sampling distribution; its endpoint mean is undefined.
- Degree is not worth, friendship quality or proof that every person has fewer connections than their contacts.