Buhl cycle-condition converse for the weak maximum likelihood threshold
Buhl cycle-condition converse for the weak maximum likelihood threshold
Let be a graph with at least one edge. An orientation of is acyclic if it has no directed cycles, and a cycle is stretched when it has the form . Let denote the weak maximum likelihood threshold. Buhl cycle-condition converse. If has an acyclic orientation with no stretched cycles, then
The forward implication is known: weak maximum likelihood threshold implies the existence of such an orientation. The conjecture asserts the converse, completing the rigidity-theoretic characterization of graphs with weak maximum likelihood threshold .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler, Anthony Nixon, Meera Sitharam and Louis Theran, “Maximum likelihood thresholds via graph rigidity”, arXiv:2108.02185 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.