1 citations · 2 across the 3 of their papers we have counts for
4 papers
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
James M. Shook, Isabel Beichl
For a digraph , a set is said to be a feedback vertex set (FVS) if is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scal…
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions
Isabel Beichl, Alathea Jensen
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume…
Approximating the Chromatic Polynomial
Yvonne Kemper, Isabel Beichl
Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small,…
Stratified Sampling for the Ising Model: A Graph-Theoretic Approach
Amanda Streib, Noah Streib, Isabel Beichl +1
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Mark…