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.
Research determines criteria for semi-regular tilings in hyperbolic space.
The study proves spherical polygon analogs of curve theorems, finding bounds on intersections and inflections.
By Hartman--Nirenberg's theorem, any complete flat hypersurface in Euclidean space must be a cylinder over a plane curve. However, if we admit some singularities, there are many non-trivial examples. Flat fronts are flat hypersurfaces with admissible singularities. Murata--Umehara gave a representation formula for comp…
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…
Research tackles learning vertex representations for bipartite networks.
New method for learning on heterogeneous graphs without meta-paths.
Graph Neural Networks (GNN) learn from graph data by sharing weights over vertices of different types.