no code implementations • 1 Feb 2021 • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean B. Ravelomanana
In effect, the analysis of the fixed point of the message passing process on a random graph reduces to analysing the process on a Galton-Watson tree.
Combinatorics 05C80
no code implementations • 13 Jan 2021 • Oliver Cooley, Mihyun Kang, Julian Zalla
Inspired by the study of loose cycles in hypergraphs, we define the \emph{loose core} in hypergraphs as a structure which mirrors the close relationship between cycles and $2$-cores in graphs.
Combinatorics 05C80, 05C65 (Primary), 05C38 (Secondary)
