7 problems
Greedy likelihood performance conjecture. Greedy likelihood should have similar performance to that of leaf stripping.
A semi-directed binary simple level-3 network is a semi-directed binary phylogenetic network of level with no additional simplicity violations, and let and denote t…
Hub-separation conjecture. The solutions to the formulation in Eq. $$ would have separated hubs in a bigger network in order to symmetrize other parts of the network connected to t…
MLLS-reconstructibility conjecture. The class of binary valid networks is MLLS-reconstructible.
Let be a subset of observing nodes or variables of a dynamical network, and let be a network node whose trajectory is to be reconstructed. Consider an ergodic trajectory on…
Let be a consistent global metabolic network with reaction set , and let be a nonempty core set of reactions. The conte…
Wiener-filter identification conjecture. The Wiener filter can be used to identify which nodes are connected to a specific node of interest by checking whether the corresponding en…