nucleation

LIT-1123: Engineering Emergence

1 min read

Properties5
StatusActive — read 2026-10-29 (NOTE-1359) in full, from arXiv's own copy (v2); worth reading as the extension of causal emergence 2.0 (LIT-1136) from one path to the whole partition lattice of a Markov chain's states, where a partition counts if its CP beats every finer partition's, and the survivors form an "emergent hierarchy" whose spread is tied to preferential attachment and can be engineered to a single scale with cycles. Read it knowing that it searches partitions of one system's states, not system–environment boundaries, prices nothing, drops CE 2.0's consistency filter on "data not shown", rests on 5- to 8-state enumerations and a 40-state greedy sampler, and that one of Figure 2's CP values (0.13) does not follow from its own determinism and degeneracy (0.24 − 0.09).
Version2
Tagscomplex-systems, causality
ExtendsLIT-1136 — Causal Emergence 2.0: Quantifying emergent complexity
Cited as “paper” byNOTE-1359 — Jansma and Hoel — Engineering emergence

Graph View

Jansma, A. & Hoel, E. (2025). arXiv preprint.

Read in full on 2026-10-29 (NOTE-1359).

Why this is here

Registered as a candidate for the follow-up in Hoel’s line that A10 of the exchange of 2026-10-16 cited (“2024/2025”), on searching for coarse-grainings rather than assuming them. That paper could not be identified uniquely (curation entries of 2026-10-16); the owner asked for every candidate to be filed. The likeliest of the candidates found. For QUESTION-115, beside Hoel et al. 2013 (LIT-1038, read).

Backlinks