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.
Max flow/min cut theorem extended to currents and topology.
We show how 'test' vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we show that a continuous version of the classical Max Flow Min Cut Theorem for net…
We propose a faster and more accurate method for learning classification trees.
The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of holographic entanglement entropies. We also prove various properties of the max flow…
New convex programs solve minimal-area problems on Riemann surfaces.
Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \cite{KZ:PAMI04} has had significant impact in computer vision \cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}. In this paper we address the important class of sum-of-submodular (SoS) function…
Proves a generalized isoperimetric inequality for spheres in dimensions 4 and above.
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This gives a relative version of Stallings' Theorem on the structure of groups with mo…
Algorithm maximizes review quality of least advantaged paper and ensures accurate paper acceptance.
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair where each of is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…
Generalizes leverage score sampling for neural networks, accelerating kernel methods and deep learning.
Positive configurations of points in the affine building were introduced in \cite{Le} as the basic object needed to define higher laminations. We start by giving a self-contained, elementary definition of positive configurations of points in the affine building and their basic properties. Then we study the geometry of …
In this paper we investigate the behavioural differences between mobile phone customers with prepaid and postpaid subscriptions. Our study reveals that (a) postpaid customers are more active in terms of service usage and (b) there are strong structural correlations in the mobile phone call network as connections betwee…
Smart inverters probe grids to infer non-metered loads.
Proposes a new optimization method for local graph clustering.