A single connection can complete a route

Cross-Domain EchoesShared pattern · Percolation Threshold

A rock can contain many pores yet provide no continuous route across the sample. A radio deployment can contain many devices yet leave its endpoints unable to communicate. The diagrams compare two finite connectivity states: two clusters are initially separate; adding the particular usable bridge between them completes a spanning route. This illustrates the local-to-global change behind percolation, without estimating a critical density from five boxes. For the pore example, this is a comparison of graph configurations, not a claim that imaging opens rock. A connected path still needs enough conductance in rock or acceptable communication quality in a mesh.

Written comparison

Before: separate clusters

Porous materials

Pore clusters attached to opposite sample boundaries

Radio networking

Radio clusters attached to separated endpoints

Each cluster has local connections, but no route joins the two sides.

The connection that changes reachability

Porous materials

A usable throat connecting the two clusters

Radio networking

A usable radio link connecting the two clusters

This particular link joins previously separate components. An arbitrary extra pore or radio need not do so.

After: a spanning route

Porous materials

The boundary-attached clusters now connect

Radio networking

The endpoint-attached clusters now connect

The added connection changes a global property of the graph while leaving the two clusters themselves in place.

What carries across

Count connected routes as well as parts. Spanning connectivity is a structural achievement, and useful transport imposes further requirements.

Where the comparison stops

The topology question transfers; material conductance, imaging resolution, radio interference and latency do not.

• The diagrams show finite routes, not proofs of an exact infinite-system critical threshold or critical exponent.
• A spanning cluster can coexist with isolated components; it does not imply every node is connected.
• Pore conductance and radio path quality are different additional constraints. Neither a segmented image nor a range map alone certifies usable transport.

Conditions for this comparison

• Pore connections are resolved at a scale that can detect controlling throats.
• Radio links are verified as usable, rather than inferred solely from geometric proximity.
• The before/after graphs are finite schematic configurations. The pore map diagnoses connectivity; it does not itself open a physical throat.

Source entries

Shared pattern

Percolation Threshold

Prime

Core Idea

Percolation threshold is the structural pattern in which a system of many local elements with local links accumulates connectivity gradually and then, at a sharp critical density of links or filled sites, sees a system-spanning connected cluster appear for the first time — transforming a previously short-ranged collection of isolated pieces into a single network that ties opposite ends of the system together.

Porous materials

Porosity & Connectivity Mapping

Mechanism

How it works

Extract the network graph. Reduce the void space to pore bodies and connecting throats with sizes attached — a graph, not a bulk fraction.

When it helps, and when it misleads

Connectivity is exquisitely sensitive to the threshold that separates void from solid: nudge it and a barely-open throat closes, severing a path that is really there, or a noise voxel bridges pores that are really separate.

Radio networking

Mesh-Link Deployment

Mechanism

How it works

Add distributed links to clear the threshold. Keep raising density until occupancy crosses the percolation point — and then keep going, for margin.

When it helps, and when it misleads

The classic misuse is reporting "the mesh is connected" from a coverage map without testing multi-hop paths under real load.