Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

76152228304 · May 202619922001200920172026
48 results for max flow/min cut theorem

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…

2017-10-26abs ↗pdf ↗

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…

2016-01-26abs ↗pdf ↗

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, …

2016-04-01abs ↗pdf ↗

Proves a generalized isoperimetric inequality for spheres in dimensions 4 and above.

problem Proving a generalized isoperimetric inequality for spheres in dimensions 4 and above.
method Reduced to a theorem about thick embeddings of graphs, proved using Kolmogorov-Barzdin theorem and max-flow min-cut theorem. Counterexample in dimension 3 uses coarea inequality and winding number computation.
result A generalized isoperimetric inequality for spheres in dimensions 4 and above.

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 s,ts, t where each of s,ts, t is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…

2013-11-15abs ↗pdf ↗

The paper solves min-max widths on a 3-sphere and strengthens multiplicity theorems.

problem Which min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π?
method Homological min-max theory and stronger versions of multiplicity one theorems.
result Proves the 10th to 13th min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π.

Proves multiplicity one for boundary minimal hypersurfaces in compact manifolds.

problem Proving multiplicity one for min-max free boundary minimal hypersurfaces in compact manifolds with boundary.
method Developed existence and regularity theory for free boundary hypersurfaces with prescribed mean curvature, including Morse index bounds.
result Proved multiplicity one theorem for min-max free boundary minimal hypersurfaces in compact manifolds with boundary.

New Gaussian min-max theorem extends classical results to non-i.i.d. Gaussian matrices.

problem Extending classical Gaussian min-max theorems to non-i.i.d. Gaussian matrices.
method Identifying a new pair of Gaussian processes that satisfy comparison inequalities.
result New Gaussian min-max and convex Gaussian min-max theorems with applications in multi-source Gaussian regression and binary classification.

Study max- and min-stability under first-order stochastic dominance, finding new functional characterizations.

problem Understanding max- and min-stability in stochastic dominance.
method Representation theorem for functionals satisfying max-stability, combining max- and min-stability to define Lambda-quantiles.
result New characterizations of functionals, including Lambda-quantiles, in finance and political science.

The study proves a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

problem Proving a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.
method Equivariant min-max theory and analysis of GG-homology classes.
result Shows a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. We consider the ana…

2018-06-01abs ↗pdf ↗

In this paper, we study the shape of the min-max minimal hypersurface produced by Almgren-Pitts-Schoen-Simon \cite{AF62, AF65, P81, SS81} in a Riemannian manifold (Mn+1,g)(M^{n+1}, g) of positive Ricci curvature for all dimensions. The min-max hypersurface has a singular set of Hausdorff codimension 77. We characterize the …

2015-04-04abs ↗pdf ↗

Proves existence of Yamabe metrics on conical 4-manifolds using min-max method.

problem Existence of Yamabe metrics on conical 4-manifolds with singular points.
method Min-max scheme adapted to singular setting, leveraging recent positive mass theorems.
result Existence of Yamabe metrics on conical 4-manifolds with finitely-many singular points.

We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer programming (MIP) technology. Yet, existing approaches from the literatur…

2020-02-21abs ↗pdf ↗

The study counts minimal surfaces in 3-manifolds with positive Ricci curvature.

problem Counting minimal surfaces in 3-manifolds with positive Ricci curvature.
method An enumerative min-max theorem linking surface counts to topological properties.
result Every 3-sphere of positive Ricci curvature contains at least 4 embedded minimal surfaces of genus 2.

Let MM be a stratum of a compact stratified space AA. It is equipped with a general adapted metric gg, which is slightly more general than the adapted metrics of Nagase and Brasselet-Hector-Saralegi. In particular, gg has a general type, which is an extension of the type of an adapted metric. A restriction on this …

2015-07-27abs ↗pdf ↗

In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus g2g\geq 2. We develop a direct variational methods similar to the proof of the famous Plateau problem by J. Douglas and T. Rado. As a result, we show that the min-max value for the area functional can be achieved by a …

2011-11-27abs ↗pdf ↗

Previously, Cristofaro-Gardiner, Hutchings and Ramos have proved that embedded contact homology (ECH) capacities can recover the volume of a contact 3-manifod in their paper "the asymptotics of ECH capacities" . There were two main steps to proving this theorem: The first step used an estimate for the energy of min-max…

2018-01-08abs ↗pdf ↗

Let (M,g)(M,g) be a compact Ricci-flat 4-manifold. For pMp \in M let Kmax(p)K_{max}(p) (respectively Kmin(p)K_{min}(p)) denote the maximum (respectively the minimum) of sectional curvatures at pp. We prove that if Kmax(p) cKmin(p)K_{max} (p) \le \ -c K_{min}(p) for all pMp \in M, for some constant cc with 0c<2+640 \leq c < \frac{2+\sqrt 6}{4}, th…

2012-10-28abs ↗pdf ↗

The study finds a way to create minimal surfaces with specific shapes in 3-manifolds.

problem Creating minimal surfaces with prescribed genus in 3-manifolds with positive Ricci curvature.
method Develops a min-max theory and shows deformability of surfaces in a generic metric.
result Establishes a theorem for producing minimal surfaces with prescribed genus.

Equity-Transformer solves NP-hard min-max routing problems efficiently.

problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.

Entropy is a natural geometric quantity measuring the complexity of a surface embedded in R3\mathbb{R}^3. For dynamical reasons relating to mean curvature flow, Colding-Ilmanen-Minicozzi-White conjectured that the entropy of any closed surface is at least that of the self-shrinking two-sphere. We prove this conjecture …

2015-09-21abs ↗pdf ↗

The paper characterizes eigenvalues of surfaces using min-max quantities for harmonic maps.

problem Characterizing eigenvalues of surfaces using harmonic maps.
method Defining min-max quantities associated with sphere-valued maps and proving eigenvalue bounds.
result Identifies Λ1(M,c)Λ_1(M,c) and Λ2(M,c)Λ_2(M,c) with min-max quantities for sphere-valued maps.

The study proves the existence of free boundary minimal disks in convex regions.

problem Proving the existence of free boundary minimal disks in convex regions.
method Based on a multiplicity-one theorem for the free boundary Simon-Smith min-max theory.
result Existence of at least three embedded free boundary minimal disks in strictly convex domains with nonnegative Ricci curvature.

Adaptive momentum method solves non-convex min-max problems.

problem Non-convex min-max optimization problems in training generative adversarial networks.
method Proposes an adaptive momentum algorithm for non-convex min-max optimization.
result Establishes non-asymptotic convergence rates for the proposed algorithm.

Study mean curvature flow in hyperbolic 3-manifolds, proving foliations and existence of minimal surfaces.

problem Existence and properties of foliations in hyperbolic 3-manifolds.
method Mean curvature flow, surgery, min-max theory, foliations, continuity of minimal surfaces.
result Existence of smooth entire foliations in quasi-Fuchsian and hyperbolic 3-manifolds.

Study on local convergence of min-max algorithms to differential equilibria on Riemannian manifolds.

problem Solving zero-sum differential games on Riemannian manifolds.
method Analysis of two simultaneous min-max algorithms, ττ-GDA and ττ-SGA, to differential Stackelberg and Nash equilibria, with conditions for linear convergence and asymptotic approximation.
result Established sufficient conditions for linear convergence of ττ-GDA and demonstrated faster convergence of ττ-SGA in some cases.