STRATA
Skip to study
XLVII

X.07 / SHARED INSTRUMENTS

Networks, graphs, multiscale systems, and complexity

How much of a network’s behavior can be predicted from its connections alone?

A source-led introduction1 source references1 related experiments

Start with the question.

Networks describe relationships through nodes and edges, but different questions require different structural measures. Watts and Strogatz's small-world work makes clustering and path length concrete examples. A network visualization should expose its construction rules, edge meanings, and missing data. Similar-looking layouts can encode different connectivity, and different layouts can represent exactly the same graph.

Hold edge count fixed while changing connectivity.

Compare six nodes arranged as one six-node ring with six nodes arranged as two separate triangles. Both graphs have six edges and every node has degree two. One is connected and the other has two components. The comparison shows why degree and edge count alone cannot describe reachability or the routes by which information could travel.

What would you inspect?

  • Component count, path length, clustering, degree distribution, and edge direction.
  • The data or rule that determines whether an edge exists.

Take the next step.

Use the network workbench to construct the two graphs, then identify which additional measure answers the specific question being asked of the network.

Put part of the question to work.

These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.

Try connectivity and removal.

Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.

Open its full page

Watch the quantities change.

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.

Read the supporting material.

  1. Collective dynamics of small-world networks

    Duncan J. Watts and Steven H. Strogatz · Network structure, clustering, path lengths, and coupled-system examples.

Follow the comparisons.

Read the neighboring questions.