Maps of Consequential Paradox.


A method of network analysis and visualisation in which:

- Every node of the graph flows to itself.

- Every node of the graph flows to the subject of the graph.

- Every node of the graph can flow to every other node of the graph.

- The subject node of the graph flows to itself in one or more ways.

- The subject node of graph can flow to every node of graph.

- Every consequential flow is reversible.

- Solid edges indicate simple dependency.

- Dashed edges indicate complex dependency.

Can be helpful in identifying: 

- Pseudo reverse consequence paths.

- True reverse consequence paths.

- Sustainability of consequence.

- Impact of consequence.

What's that mean in the real world ?

- Reverse power relationships.

- Design/ implant and identify/ remove sub-conscious repetitive thought and behaviour.

Catalog of maps.

Heath Bunting.