A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper determines Assouad-Nagata dimension for all minor-closed metrics.
Graph pruning improves neural network performance by addressing squashing and smoothing issues.
New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.
A well-known problem in data science and machine learning is {\em linear regression}, which is recently extended to dynamic graphs. Existing exact algorithms for updating the solution of dynamic graph regression require at least a linear time (in terms of : the size of the graph). However, this time complexity might…
We construct an extension of the Kontsevich integral of knots to knotted trivalent graphs, which commutes with orientation switches, edge deletions, edge unzips, and connected sums. In 1997 Murakami and Ohtsuki [MO] first constructed such an extension, building on Drinfel'd's theory of associators. We construct a step …
XGES improves GES by favoring early edge deletion, outperforming GES in finite data settings.
A plane graph is a {\em plane minor} of a plane graph if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes to . Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmativ…
Develops structured noise for more accurate graph classifier robustness certificates.
GNNs robustness in community detection is studied with various perturbations.
Optimal transport for measures on noisy tree metrics is solved with robust approach.