Benjamin Hollering
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Benjamin Hollering has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Améndola
Technische Universität Berlin, Berlin, Germany
2 shared publications - Elia Mazzucchelli
Max-Plank-Institut für Physik Werner-Heisenberg-Institut D-85748 München Germany
2 shared publications Joseph Cummings
2 shared publications- Pratik Misra
Department of Mathematics, Technical University of Munich, Garching b. München, Germany
2 shared publications Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences
1 shared publication- Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication
Latest Publications
- Open Access
- 22 September 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 114 (6) , 066014
Positivity and cluster structures in Landau analysis
Landau analysis in momentum twistor space can be formulated as the study of varieties of lines in three-dimensional projective space, together with their projections and discriminants. Within this framework, we define enumerative invariants (leading singularity (LS) degrees) that count leading singularities. Leading Landau singularities (LS discriminants) arise as discriminants detecting the collision of leading singularities. We uncover a recursive mechanism underlying Landau singularities, governed by substitution maps between Grassmannians. Applying this framework, we prove positivity and factorization into cluster variables for the LS discriminant of a large class of Landau diagrams at arbitrary loop order. This provides a first-principles explanation for the emergence of positivity and cluster algebra structures in scattering amplitudes of planar N = 4 super Yang-Mills theory.
- 22 September 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 114 (6) , 066014
Open AccessPositivity and cluster structures in Landau analysis
Landau analysis in momentum twistor space can be formulated as the study of varieties of lines in three-dimensional projective space, together with their projections and discriminants. Within this framework, we define enumerative invariants (leading singularity (LS) degrees) that count leading singularities. Leading Landau singularities (LS discriminants) arise as discriminants detecting the collision of leading singularities. We uncover a recursive mechanism underlying Landau singularities, governed by substitution maps between Grassmannians. Applying this framework, we prove positivity and factorization into cluster variables for the LS discriminant of a large class of Landau diagrams at arbitrary loop order. This provides a first-principles explanation for the emergence of positivity and cluster algebra structures in scattering amplitudes of planar N = 4 super Yang-Mills theory.
- 1 February 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (1) , 638-663
Faithlessness in Gaussian graphical models
The implication problem for conditional independence (CI) asks whether the fact that a probability distribution obeys a given finite set of CI relations implies that a further CI statement also holds in this distribution. This problem has a long and fascinating history, cumulating in positive results about implications now known as the semigraphoid axioms as well as impossibility results about a general finite characterization of CI implications. Motivated by violation of faithfulness assumptions in causal discovery, we study the implication problem in the special setting where the CI relations are obtained from a directed acyclic graphical (DAG) model along with one additional CI statement. Focusing on the Gaussian case, we show that this implication problem reduces to a principal ideal membership problem. Using this we derive necessary and sufficient combinatorial criteria for when the set of faithless distributions decomposes into graphical components. Moreover, prompted by the relevance of strong faithfulness in statistical guarantees for causal discovery algorithms, we give a graphical solution for an approximate CI implication problem, in which we ask whether small values of one additional partial correlation entail small values for yet a further partial correlation.
- 1 February 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (1) , 638-663
Faithlessness in Gaussian graphical models
The implication problem for conditional independence (CI) asks whether the fact that a probability distribution obeys a given finite set of CI relations implies that a further CI statement also holds in this distribution. This problem has a long and fascinating history, cumulating in positive results about implications now known as the semigraphoid axioms as well as impossibility results about a general finite characterization of CI implications. Motivated by violation of faithfulness assumptions in causal discovery, we study the implication problem in the special setting where the CI relations are obtained from a directed acyclic graphical (DAG) model along with one additional CI statement. Focusing on the Gaussian case, we show that this implication problem reduces to a principal ideal membership problem. Using this we derive necessary and sufficient combinatorial criteria for when the set of faithless distributions decomposes into graphical components. Moreover, prompted by the relevance of strong faithfulness in statistical guarantees for causal discovery algorithms, we give a graphical solution for an approximate CI implication problem, in which we ask whether small values of one additional partial correlation entail small values for yet a further partial correlation.
- Open Access
Varieties of Lines in 3-Space
We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the dimension of the incidence variety and characterize when it is irreducible or a complete intersection. We study its multidegree and the family of Schubert problems it encodes. Our spanning-tree coordinates enable efficient symbolic computations. We also provide numerical irreducible decompositions for incidence varieties with up to eight lines. These constructions with lines play a key role in the Landau analysis of scattering amplitudes in particle physics.
Open AccessVarieties of Lines in 3-Space
We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the dimension of the incidence variety and characterize when it is irreducible or a complete intersection. We study its multidegree and the family of Schubert problems it encodes. Our spanning-tree coordinates enable efficient symbolic computations. We also provide numerical irreducible decompositions for incidence varieties with up to eight lines. These constructions with lines play a key role in the Landau analysis of scattering amplitudes in particle physics.
- Open Access
Structural Identifiability of Graphical Continuous Lyapunov Models
We prove two characterizations of model equivalence of acyclic graphical continuous Lyapunov models (GCLMs) with uncorrelated noise. The first result shows that two graphs are model equivalent if and only if they have the same skeleton and equivalent induced 4-node subgraphs. We also give a transformational characterization via structured edge reversals. The two theorems are Lyapunov analogues of celebrated results for Bayesian networks by Verma and Pearl, and Chickering, respectively. Our results have broad consequences for the theory of causal inference of GCLMs. First, we find that model equivalence classes of acyclic GCLMs refine the corresponding classes of Bayesian networks. Furthermore, we obtain polynomial-time algorithms to test model equivalence and structural identifiability of given directed acyclic graphs.
Open AccessStructural Identifiability of Graphical Continuous Lyapunov Models
We prove two characterizations of model equivalence of acyclic graphical continuous Lyapunov models (GCLMs) with uncorrelated noise. The first result shows that two graphs are model equivalent if and only if they have the same skeleton and equivalent induced 4-node subgraphs. We also give a transformational characterization via structured edge reversals. The two theorems are Lyapunov analogues of celebrated results for Bayesian networks by Verma and Pearl, and Chickering, respectively. Our results have broad consequences for the theory of causal inference of GCLMs. First, we find that model equivalence classes of acyclic GCLMs refine the corresponding classes of Bayesian networks. Furthermore, we obtain polynomial-time algorithms to test model equivalence and structural identifiability of given directed acyclic graphs.
- Open Access
A PC Algorithm for Max-Linear Bayesian Networks
Max-linear Bayesian networks (MLBNs) are a relatively recent class of structural equation models which arise when the random variables involved have heavy-tailed distributions. Unlike most directed graphical models, MLBNs are typically not faithful to d-separation and thus classical causal discovery algorithms such as the PC algorithm or greedy equivalence search can not be used to accurately recover the true graph structure. In this paper, we begin the study of constraint-based discovery algorithms for MLBNs given an oracle for testing conditional independence in the true, unknown graph. We show that if the oracle is given by the $\ast$-separation criteria in the true graph, then the PC algorithm remains consistent despite the presence of additional CI statements implied by $\ast$-separation. We also introduce a new causal discovery algorithm named "PCstar" which assumes faithfulness to $C^\ast$-separation and is able to orient additional edges which cannot be oriented with only d- or $\ast$-separation.
Open AccessA PC Algorithm for Max-Linear Bayesian Networks
Max-linear Bayesian networks (MLBNs) are a relatively recent class of structural equation models which arise when the random variables involved have heavy-tailed distributions. Unlike most directed graphical models, MLBNs are typically not faithful to d-separation and thus classical causal discovery algorithms such as the PC algorithm or greedy equivalence search can not be used to accurately recover the true graph structure. In this paper, we begin the study of constraint-based discovery algorithms for MLBNs given an oracle for testing conditional independence in the true, unknown graph. We show that if the oracle is given by the $\ast$-separation criteria in the true graph, then the PC algorithm remains consistent despite the presence of additional CI statements implied by $\ast$-separation. We also introduce a new causal discovery algorithm named "PCstar" which assumes faithfulness to $C^\ast$-separation and is able to orient additional edges which cannot be oriented with only d- or $\ast$-separation.
- Open Access
- 20 May 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Computing implicitizations of multi-graded polynomial maps
- 20 May 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Open AccessComputing implicitizations of multi-graded polynomial maps
- Open Access
- 21 February 2025
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 184
Conditional independence in stationary distributions of diffusions
- 21 February 2025
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 184
Open AccessConditional independence in stationary distributions of diffusions
- 27 October 2023
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 153
Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- 27 October 2023
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 153
Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Open Access
Toric Ideals of Characteristic Imsets via Quasi-Independence Gluing
Characteristic imsets are 0-1 vectors which correspond to Markov equivalence classes of directed acyclic graphs. The study of their convex hull, named the characteristic imset polytope, has led to new and interesting geometric perspectives on the important problem of causal discovery. In this paper we begin the study of the associated toric ideal. We develop a new generalization of the toric fiber product, which we call a quasi-independence gluing, and show that under certain combinatorial homogeneity conditions, one can iteratively compute a Gr\"obner basis via lifting. For faces of the characteristic imset polytope associated to trees, we apply this technique to compute a Gr\"obner basis for the associated toric ideal. We end with a study of the characteristic ideal of the cycle and propose directions for future work.
Open AccessToric Ideals of Characteristic Imsets via Quasi-Independence Gluing
Characteristic imsets are 0-1 vectors which correspond to Markov equivalence classes of directed acyclic graphs. The study of their convex hull, named the characteristic imset polytope, has led to new and interesting geometric perspectives on the important problem of causal discovery. In this paper we begin the study of the associated toric ideal. We develop a new generalization of the toric fiber product, which we call a quasi-independence gluing, and show that under certain combinatorial homogeneity conditions, one can iteratively compute a Gr\"obner basis via lifting. For faces of the characteristic imset polytope associated to trees, we apply this technique to compute a Gr\"obner basis for the associated toric ideal. We end with a study of the characteristic ideal of the cycle and propose directions for future work.