STRATA
Skip to study
XLVII

XLVII / Experiments

Workbench

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

When does a collection of local links form a connected whole?

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.

Paths connect the orange group.

Largest groupOther groupsCrosses mark removed nodes
000.50.511Node 0: degree 3, group 1.Node 1: degree 8, group 1.Node 2: degree 8, group 1.Node 3: degree 8, group 1.Node 4: degree 1, group 3.Node 5: degree 5, group 1.Node 6: degree 4, group 1.Node 7: degree 10, group 1.Node 8: degree 5, group 1.Node 9: degree 6, group 1.Node 10: degree 5, group 1.Node 11: degree 2, group 1.Node 12: degree 5, group 1.Node 13: degree 3, group 1.Node 14: degree 2, group 1.Node 15: degree 5, group 1.Node 16: degree 6, group 1.Node 17: degree 1, group 1.Node 18: degree 2, group 1.Node 19: degree 6, group 1.Node 20: degree 9, group 1.Node 21: degree 4, group 1.Node 22: degree 2, group 2.Node 23: degree 4, group 1.Node 24: degree 7, group 1.Node 25: degree 3, group 1.Node 26: degree 8, group 1.Node 27: degree 5, group 1.Node 28: degree 1, group 1.Node 29: degree 3, group 1.Node 30: degree 5, group 1.Node 31: degree 4, group 1.Node 32: degree 8, group 1.Node 33: degree 2, group 2.Node 34: degree 5, group 1.Node 35: degree 3, group 1.Node 36: degree 7, group 1.Node 37: degree 7, group 1.Node 38: degree 1, group 3.Node 39: degree 5, group 1.Node 40: degree 4, group 1.Node 41: degree 3, group 1.Node 42: degree 4, group 1.Node 43: degree 3, group 1.Node 44: degree 7, group 1.Node 45: degree 5, group 1.Node 46: degree 2, group 1.Node 47: degree 2, group 2.x coordinate (unit square)y coordinate
Node positions stay fixed while the radius or removal rule changes. Larger filled dots have more active neighbors; hollow dots are isolated. Hover a node for its identifier and degree.
Largest connected group
43 / 48

89.6% of active nodes.

Connected components
3

Every pair within a group has a path.

Active edges
109

4.54 neighbors per active node on average.

Isolated nodes
0

0 nodes have been removed separately.

The eight largest connected groups are shown. The CSV includes every node, its current degree, and its group rank; the JSON also includes the edge list.
Group, largest firstNodesShare of active nodes
14389.6%
236.3%
324.2%

Keep a reproducible record.

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

The calculation follows these rules.

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.

Read the result within its assumptions.

  • This is a random geometric graph in a flat unit square. Edges are unweighted and undirected, with no travel time, capacity, or transmission dynamics.
  • Boundary nodes have fewer nearby opportunities than central nodes. The square does not wrap around.
  • One seeded realization illustrates a mechanism. It does not establish a universal connectivity threshold or the behavior of a real infrastructure network.

Take the experiment further.

01

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.

02

Compare removal rules.

Keep the seed, radius, and removal count fixed while switching removal order. Record the largest group and isolated-node count for each case.

03

Test another realization.

Repeat your comparison with another seed. Decide which conclusion survives and which depended on the original placement.

Read the sources behind the model.

  1. NetworkX, Random geometric graph

    The official reference defines uniform point placement and distance-based edges for this graph family.

Watch one model run.

12 seconds · Original model visualization · Silent

Connectivity and removal

Compare local connections with the paths that hold a network together.

Read the explanation and method

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.

Apply the model to a research question.

These dossiers explain how this experiment relates to a larger question, including the observation or comparison that the model leaves unresolved.

Try another experiment.