arXiv subjects

Maximilian Wiesmann

Publications and source records attributed to Maximilian Wiesmann.

13 recordsLinked to original sources

arXiv2026

An edge-bicolored graph approach to the Ising model on random regular graphs

We give an exact solution of the ferromagnetic Ising model on a random regular graph ensemble via analytic combinatorics. Expressing the partition function as the generating function of labeled edge-bicolored graphs, we obtain the free energy in the thermodynamic limit from the asymptotic enumeration of these graphs. A simple analysis of the resulting formula reveals a second-order phase transition with critical exponents of the mean-field universality class.

math-ph↗

arXiv2026

Asymptotic number of edge-colored regular graphs

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 points of a polynomial encoding the vertex-incidences. As an application, we compute the expected number of proper $c$-edge-colorings of a large random $k$-regular graph.

math.CO↗

arXiv2026

The Likelihood Correspondence

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 Laurent monomials in the equations of the smooth hypersurfaces. The family of these loci forms an irreducible variety in the product of two projective spaces, known in algebraic statistics as the likelihood correspondence and in particle physics as the scattering correspondence. We establish an explicit determinantal representation for the minimal generators of the bihomogeneous prime ideal that defines this variety.

math.AC↗

arXiv2026

Lee-Yang phenomena in edge-coloured graph counting

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 polynomial, which specialises to the partition function of the ferromagnetic Ising model on a random regular graph. We call this accumulation behaviour a Lee-Yang phenomenon in analogy with the Lee-Yang theorem. The limiting loci are semialgebraic and arise from anti-Stokes curves of an exponential integral.

math.CO↗

arXiv2025

Squared Linear Models

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 each region of the projective hyperplane arrangement defined by the linear forms. We examine the ideal and singular locus of the model, and we give a determinantal presentation for its likelihood correspondence. We characterize tropical degenerations of the MLE, we describe the log-normal polytopes, and we explore connections to determinantal point processes.

math.AC↗

arXiv2025

Arrangements and Likelihood

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 object is well-studied in the linear case, when the hypersurfaces are hyperplanes. We here focus on nonlinear scenarios and their applications in statistics and physics.

math.AC↗

arXiv2025

The Maximum Likelihood Degree of Toric Models is Monotonic

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 discuss the impact on the ML degree from observing zeros in the data. Moreover, we connect this problem to tropical likelihood degenerations, and show how the results can be applied to discrete graphical and quasi-independence models.

math.AG↗

arXiv2024

Geometry of Polynomial Neural Networks

We study the expressivity and learning process for polynomial neural networks (PNNs) with monomial activation functions. The weights of the network parametrize the neuromanifold. In this paper, we study certain neuromanifolds using tools from algebraic geometry: we give explicit descriptions as semialgebraic sets and characterize their Zariski closures, called neurovarieties. We study their dimension and associate an algebraic degree, the learning degree, to the neurovariety. The dimension serves as a geometric measure for the expressivity of the network, the learning degree is a measure for the complexity of training the network and provides upper bounds on the number of learnable functions. These theoretical results are accompanied with experiments.

math.AG↗

arXiv2024

Bivariate exponential integrals and edge-bicolored graphs

We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights assigned to different vertex structures. The asymptotic behavior is governed by the critical points of a polynomial. As an application, we discuss the Ising model on a random 4-regular graph and show how its phase transitions arise from our formula.

math.CO↗

arXiv2024

Euler Stratifications of Hypersurface Families

We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate and exploit the relation to critical point computations. Euler stratifications are relevant in particle physics and algebraic statistics. They fully describe the dependence of the number of master integrals, respectively the maximum likelihood degree, on kinematic or model parameters.

math.AG↗

arXiv2024

Pathological Regularization Regimes in Classification Tasks

In this paper we demonstrate the possibility of a trend reversal in binary classification tasks between the dataset and a classification score obtained from a trained model. This trend reversal occurs for certain choices of the regularization parameter for model training, namely, if the parameter is contained in what we call the pathological regularization regime. For ridge regression, we give necessary and sufficient algebraic conditions on the dataset for the existence of a pathological regularization regime. Moreover, our results provide a data science practitioner with a hands-on tool to avoid hyperparameter choices suffering from trend reversal. We furthermore present numerical results on pathological regularization regimes for logistic regression. Finally, we draw connections to datasets exhibiting Simpson's paradox, providing a natural source of pathological datasets.

stat.ML↗

arXiv2023

Algebraic Geometry of Quantum Graphical Models

Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical models are families of quantum states satisfying certain locality or correlation conditions encoded by a graph. We lay out several ways to associate an algebraic variety to a quantum graphical model. The classical graphical models can be recovered from most of these varieties by restricting to quantum states represented by diagonal matrices. We study fundamental properties of these varieties and provide algorithms to compute their defining equations. Moreover, we study quantum information projections to quantum exponential families defined by graphs and prove a quantum analogue of Birch's Theorem.

math.AG↗

arXiv2023

Toric Fiber Products in Geometric Modeling

An important challenge in Geometric Modeling is to classify polytopes with rational linear precision. Equivalently, in Algebraic Statistics one is interested in classifying scaled toric varieties, also known as discrete exponential families, for which the maximum likelihood estimator can be written in closed form as a rational function of the data (rational MLE). The toric fiber product (TFP) of statistical models is an operation to iteratively construct new models with rational MLE from lower dimensional ones. In this paper we introduce TFPs to the Geometric Modeling setting to construct polytopes with rational linear precision and give explicit formulae for their blending functions. A special case of the TFP is taking the Cartesian product of two polytopes and their blending functions. The Horn matrix of a statistical model with rational MLE is a key player in both Geometric Modeling and Algebraic Statistics; it proved to be fruitful providing a characterisation of those polytopes having the more restrictive property of strict linear precision. We give an explicit description of the Horn matrix of a TFP.

math.AG↗