Related Experiment Video
Updated: Jan 24, 2026

Optogenetic Phase Transition of TDP-43 in Spinal Motor Neurons of Zebrafish Larvae
Published on: February 25, 2022
Typology of phase transitions in Bayesian inference problems.
Federico Ricci-Tersenghi1, Guilhem Semerjian2, Lenka Zdeborová3
1Diparimento di Fisica, Sapienza Università di Roma, Nanotec CNR, UOS di Roma, and INFN Sezione di Roma 1, Piazzale Aldo Moro 5, 00185 Roma, Italy.
This study refines understanding of phase transitions in random graph inference, introducing a "hybrid-hard phase" where optimal solutions are computationally difficult. Researchers used cavity equations to analyze this phase in various models, including the stochastic block model (SBM).
Area of Science:
- Statistical physics and information theory applied to network science and computational complexity.
Background:
- Inference problems on random graphs, like the stochastic block model (SBM), exhibit phase transitions affecting optimal estimation and efficient algorithms.
- Computational gaps arise when these phase transitions differ, creating 'hard phases' where optimal inference is computationally intractable.
Purpose of the Study:
- To refine the understanding of phase transitions in inference problems, particularly introducing and analyzing the 'hybrid-hard phase'.
- To quantitatively investigate the computational gap and the tightness of the Kesten-Stigum (KS) bound in various SBM variants and related problems.
Main Methods:
- Expansion of functional cavity equations around the trivial solution for sparse graph inference problems.
- Analysis of phase diagrams, including the identification of hybrid-hard phases.
- Investigation of the Kesten-Stigum (KS) bound's tightness for tree reconstruction problems and message-passing algorithms.
Main Results:
- Identification of generic phase diagrams featuring a hybrid-hard phase, where partial inference is easy but optimal inference is hard.
- Demonstration that trivial fixed point instability does not guarantee Bayes optimality of message-passing algorithms.
- Characterization of the KS bound's tightness for symmetric SBM (four communities) and tree reconstruction (Potts model), distinguishing assortative and disassortative cases based on degree distribution.
Conclusions:
- The study provides a more nuanced understanding of computational complexity in graph inference, moving beyond simple hard/easy phase distinctions.
- Results clarify the conditions under which efficient algorithms achieve near-optimal or optimal performance, with implications for various constraint satisfaction problems.
- Cavity method expansions accurately describe the behavior of belief propagation algorithms on large samples.
Related Concept Videos
Phase Transitions
Phase Transitions: Sublimation and Deposition
Phase Transitions: Melting and Freezing
Phase Transitions: Vaporization and Condensation
Phase Diagrams
Properties of Transition Metals

