ArticleEntropy (Basel, Switzerland)2026
A Sequential Markov Probabilistic Aggregation Algorithm for Causal Emergence in Markov Aggregation.
Article in Entropy (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Causal emergence (CE) is a phenomenon in which macrodynamics provide better effective information (EI) than microdynamics. The CE is widely used as the objective function in Markov aggregation. The existing works focus on deterministic aggregation, which may not offer a good solution since the search space of each step is finite. To solve this problem, we propose a sequential Markov probabilistic aggregation (SMPA) algorithm. We first express the aggregation problem as an optimization problem, then find that the EI is maximized when the transition probability matrix is a permutation matrix, and prove that the optimization problem is a nonconvex function of the probabilistic aggregation matrix. In the SMPA algorithm, the optimization problem is split into multiple univariate optimizations. Compared with the deterministic aggregation algorithm, SMPA can achieve better greedy solutions. The experimental results indicate that probabilistic aggregation generally performs better than deterministic aggregation.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.