The inflation technique for causal inference with latent variables
The problem of causal inference is to determine if a given probability distribution on
observed variables is compatible with some causal structure. The difficult case is when the …
observed variables is compatible with some causal structure. The difficult case is when the …
Experimental nonclassicality in a causal network without assuming freedom of choice
In a Bell experiment, it is natural to seek a causal account of correlations wherein only a
common cause acts on the outcomes. For this causal structure, Bell inequality violations can …
common cause acts on the outcomes. For this causal structure, Bell inequality violations can …
Computing convex hulls and counting integer points with polymake
B Assarf, E Gawrilow, K Herr, M Joswig… - Mathematical …, 2017 - Springer
The main purpose of this paper is to report on the state of the art of computing integer hulls
and their facets as well as counting lattice points in convex polytopes. Using the polymake …
and their facets as well as counting lattice points in convex polytopes. Using the polymake …
All the noncontextuality inequalities for arbitrary prepare-and-measure experiments with respect to any fixed set of operational equivalences
Within the framework of generalized noncontextuality, we introduce a general technique for
systematically deriving noncontextuality inequalities for any experiment involving finitely …
systematically deriving noncontextuality inequalities for any experiment involving finitely …
Holographic entropy cone for five regions
S Hernández Cuenca - Physical Review D, 2019 - APS
Even though little is known about the quantum entropy cone for N≥ 4 subsystems,
holographic techniques allow one to get a handle on the subspace of entropy vectors …
holographic techniques allow one to get a handle on the subspace of entropy vectors …
Polytopic matrix factorization: Determinant maximization based criterion and identifiability
G Tatli, AT Erdogan - IEEE Transactions on Signal Processing, 2021 - ieeexplore.ieee.org
We introduce Polytopic Matrix Factorization (PMF) as a novel data decomposition approach.
In this new framework, we model input data as unknown linear transformations of some …
In this new framework, we model input data as unknown linear transformations of some …
Parallel enumeration of triangulations
C Jordan, M Joswig, L Kastner - arXiv preprint arXiv:1709.04746, 2017 - arxiv.org
We report on the implementation of an algorithm for computing the set of all regular
triangulations of finitely many points in Euclidean space. This algorithm, which we call down …
triangulations of finitely many points in Euclidean space. This algorithm, which we call down …
Dimension reduction via colour refinement
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as
a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph …
a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph …
Algorithms for highly symmetric linear and integer programs
R Bödi, K Herr, M Joswig - Mathematical Programming, 2013 - Springer
This paper deals with exploiting symmetry for solving linear and integer programming
problems. Basic properties of linear representations of finite groups can be used to reduce …
problems. Basic properties of linear representations of finite groups can be used to reduce …
Computing symmetry groups of polyhedra
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure
as well as for practical polyhedral computations. In this note, we study symmetry groups …
as well as for practical polyhedral computations. In this note, we study symmetry groups …