B07
Universality and critical phenomena
Which systems share a critical exponent after the measurements are scaled to comparable units?

X.07 / SHARED INSTRUMENTS
How much of a network’s behavior can be predicted from its connections alone?
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.
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.
Use the network workbench to construct the two graphs, then identify which additional measure answers the specific question being asked of the network.
These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.
Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.
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.
Duncan J. Watts and Steven H. Strogatz · Network structure, clustering, path lengths, and coupled-system examples.
B07
Which systems share a critical exponent after the measurements are scaled to comparable units?
B16
Can systems with identical connectivity exhibit different collective behavior under different local rules?
B26
Which correlations survive when a tensor-network representation is truncated?