Find a joining edge.
Increase the radius in steps of 0.01. Watch for a sudden decrease in group count and identify the region where groups join.

XLVII / Experiments
Change a condition, inspect what happens, and keep the result. Six experiments connect an equation with a visible outcome, a numerical record, and questions you can pursue.
Connectivity and removal
Place points in a square and connect pairs that lie within a chosen radius. A small change in connection distance can join several groups. Remove a few points to test how much that connectivity depends on their positions and degrees.
89.6% of active nodes.
Every pair within a group has a path.
4.54 neighbors per active node on average.
0 nodes have been removed separately.
| Group, largest first | Nodes | Share of active nodes |
|---|---|---|
| 1 | 43 | 89.6% |
| 2 | 3 | 6.3% |
| 3 | 2 | 4.2% |
The JSON includes parameters, model assumptions, sources, and full results. The CSV contains all nodes with positions, current degree, group rank, and removal state.
Method
Two nodes share an undirected edge when their Euclidean distance is at most the connection radius. After removal, a depth-first traversal assigns every active node to a connected component. Groups are ranked by size; ties use their lowest node identifier.
Edge(i, j) exists when √[(xᵢ − xⱼ)² + (yᵢ − yⱼ)²] ≤ radius; mean degree = 2 × edges / active nodes.
Increase the radius in steps of 0.01. Watch for a sudden decrease in group count and identify the region where groups join.
Keep the seed, radius, and removal count fixed while switching removal order. Record the largest group and isolated-node count for each case.
Repeat your comparison with another seed. Decide which conclusion survives and which depended on the original placement.
The official reference defines uniform point placement and distance-based edges for this graph family.
Compare local connections with the paths that hold a network together.
Forty-eight points are drawn from one fixed random seed. A link joins two points whenever their distance is within the displayed radius.
The radius grows from 0.05 to 0.4 of the unit square. Existing links remain while new links merge previously separate connected groups.
Orange marks the largest connected group. Connectivity here describes paths through this constructed graph; it does not measure information quality, influence, or causality.
Method. Two nodes share an undirected edge when their Euclidean distance is at most the connection radius. After removal, a depth-first traversal assigns every active node to a connected component. Groups are ranked by size; ties use their lowest node identifier.
These dossiers explain how this experiment relates to a larger question, including the observation or comparison that the model leaves unresolved.