activity
20142023
most citedParity binomial edge ideals

18 citations · 19 across the 2 of their papers we have counts for

collaborators

6 papers

stat.ML2023★ 1 cited

: Generating Realistic Production Data for Benchmarking Causal Discovery

Konstantin Göbler, Tobias Windisch, Mathias Drton +3

Algorithms for causal discovery have recently undergone rapid advances and increasingly draw on flexible nonparametric methods to process complex data. With these advances comes a…

math.CO2016

Heat-bath random walks with Markov bases

Caprice Stanley, Tobias Windisch

Graphs on lattice points are studied whose edges come from a finite set of allowed moves of arbitrary length. We show that the diameter of these graphs on fibers of a fixed integer…

math.CO2016

The fiber dimension of a graph

Tobias Windisch

Graphs on integer points of polytopes whose edges come from a set of allowed differences are studied. It is shown that any simple graph can be embedded in that way. The minimal dim…

math.CO2015

Rapid mixing and Markov bases

Tobias Windisch

The mixing behaviour of random walks on lattice points of polytopes using Markov bases is examined. It is shown that under a dilation of the underlying polytope, these random walks…

math.AC2015★ 18 cited

Parity binomial edge ideals

Thomas Kahle, Camilo Sarmiento, Tobias Windisch

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gröbner bases and are radical if only if the graph…

math.CO2014

On the Connectivity of Fiber Graphs

Raymond Hemmecke, Tobias Windisch

We consider the connectivity of fiber graphs with respect to Gröbner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gröbner basis and…