7 papers
Asymptotic number of edge-colored regular graphs
Michael Borinsky, Chiara Meroni, Maximilian Wiesmann
We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical p…
Lee-Yang phenomena in edge-coloured graph counting
Maximilian Wiesmann
We study the accumulation of zeros of a polynomial arising from the enumeration of edge-coloured graphs along certain limit curves. The polynomial is a variant of an edge-chromatic…
The Maximum Likelihood Degree of Toric Models is Monotonic
Carlos Améndola, Janike Oldekop, Maximilian Wiesmann
We settle a conjecture by Coons and Sullivant stating that the maximum likelihood (ML) degree of a facial submodel of a toric model is at most the ML degree of the model itself. We…
Squared Linear Models
Hannah Friedman, Bernd Sturmfels, Maximilian Wiesmann
We study statistical models that are parametrized by squares of linear forms. All critical points of the likelihood function are real and positive. There is one critical point in e…
The Likelihood Correspondence
Thomas Kahle, Hal Schenck, Bernd Sturmfels +1
An arrangement of hypersurfaces in projective space is strict normal crossing (SNC) if and only if its Euler discriminant is nonzero. We study the critical loci of arbitrary Lauren…
Arrangements and Likelihood
Thomas Kahle, Lukas Kühne, Leonie Mühlherr +2
We develop novel tools for computing the likelihood correspondence of an arrangement of hypersurfaces in a projective space. This uses the module of logarithmic derivations. This o…