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.
The paper proves flow-cut theorems in Riemannian and Lorentzian geometries.
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.
New convex programs solve minimal-area problems on Riemann surfaces.
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, …
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…
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…
The study compares prepaid and postpaid mobile phone users and predicts their subscription type.
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 …
Min-cut clustering, based on minimizing one of two heuristic cost-functions proposed by Shi and Malik, has spawned tremendous research, both analytic and algorithmic, in the graph partitioning and image segmentation communities over the last decade. It is however unclear if these heuristics can be derived from a more g…
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…
Algorithm maximizes review quality of least advantaged paper and ensures accurate paper acceptance.
New method reduces errors in causal discovery from data.
McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised…
Generalizes leverage score sampling for neural networks, accelerating kernel methods and deep learning.
Mapper merges GNNs with TDA for graph visualisation.
New framework analyzes effectiveness of neural network-based combinatorial problem solvers.
Smart inverters probe grids to infer non-metered loads.
This paper presents a method to summarize directed graphs while preserving edge information.
Proposes a new optimization method for local graph clustering.
A novel hypergraph partitioning method using tensor eigenvalue decomposition captures super-dyadic interactions.