3 papers
math.CO2026
Excluding an induced star in dense random graphs
Sam van der Poel
For fixed , we study the asymptotic number and typical structure of dense graphs with no induced copy of the star . We solve the associated graphon variational pro…
cs.DS2026
Spectral recovery of a planted triangle-dense subgraph
Sam van der Poel, Cheng Mao, Benjamin McKenna
Given a simple graph on vertices and a parameter , the triangle-densest--subgraph problem is known to be computationally hard in the worst case. To circumvent the computa…
cs.LG2023
MLRegTest: A Benchmark for the Machine Learning of Regular Languages
Sam van der Poel, Dakotah Lambert, Kalina Kostyszyn +9
Synthetic datasets constructed from formal languages allow fine-grained examination of the learning and generalization capabilities of machine learning systems for sequence classif…