4 papers
Who killed Lilly Kane? A case study in applying knowledge graphs to crime fiction
Mariam Alaverdian, William Gilroy, Veronica Kirgios +6
We present a preliminary study of a knowledge graph created from season one of the television show Veronica Mars, which follows the eponymous young private investigator as she atte…
Power Weighted Shortest Paths for Clustering Euclidean Data
Daniel Mckenzie, Steven Damelin
We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of…
On the neighborliness of dual flow polytopes of quivers
Patricio Gallardo, Daniel Mckenzie
In this note we investigate under which conditions the dual of the flow polytope (henceforth referred to as the `dual flow polytope') of a quiver is k-neighborly, for generic weigh…
Compressive Sensing for cut improvement and local clustering
Ming-Jun Lai, Daniel Mckenzie
We show how one can phrase the cut improvement problem for graphs as a sparse recovery problem, whence one can use algorithms originally developed for use in compressive sensing (s…