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.

169,181 papers · 148 categories

Trend · papers per month

76152227303 · Jun 202019922001200920182026
48 results for Entire graphs

Develops a method to construct entire minimal graphs of odd dimensions.

problem Constructing entire minimal graphs of odd dimensions and arbitrary codimensions.
method Evolving-plane ansatz reducing minimal surface system to geodesic equation on Grassmannian.
result Yields a rich family of explicit entire minimal graphs of odd dimension and arbitrary codimension.

New examples of mixed-type zero-curvature graphs found.

problem Finding new examples of zero-curvature graphs in Lorentz-Minkowski space.
method Using Konderak's representation formula to construct entire zero-curvature graphs over specific planes.
result Existence of new types of entire zero-curvature graphs in mixed-type in Lorentz-Minkowski space.

Entire minimal graphs in Heisenberg space have negative Gauss curvature.

problem Characterizing entire minimal graphs in Heisenberg space.
method Defining holomorphic quadratic differentials and using them to describe entire graphs.
result Entire minimal graphs in Heisenberg space have negative Gauss curvature.

Study inverse mean curvature flow on entire graphs, proving finite time existence for certain asymptotic cases.

problem Analyzing the evolution of entire graphs under inverse mean curvature flow.
method Global existence for starshaped graphs, critical case analysis for asymptotically conical graphs.
result Existence of a finite time \( T \) for certain asymptotically conical graphs, convergence to a flat plane as \( t o T \).

Proposes an unsupervised graph neural network for entire graph representation.

problem Lack of unsupervised methods for entire graph representation.
method Combines hierarchical graph neural networks and mutual information maximization.
result Improves state-of-the-art performance on multiple graph level tasks.

We consider the mean curvature flow of entire Lagrangian graphs with Lipschitz continuous initial data. Assuming only a certain bound on the Lipschitz norm of an initial entire Lagrangian graph in R2n\R^{2n}, we show that the parabolic equation \eqref{PMA} for the Lagrangian potential has a longtime solution which is sm…

2009-02-19abs ↗pdf ↗

We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2^$ for graphs with n+1 singularities. We also give an explicit description of the family of entire maximal graphs with a f…

2009-03-17abs ↗pdf ↗

We present two initial graphs over the entire Rn\mathbb{R}^n, n2n \geq 2 for which the mean curvature flow behaves differently from the heat flow. In the first example, the two flows stabilize at different heights. With our second example, the mean curvature flow oscillates indefinitely while the heat flow stabilizes. …

2015-11-25abs ↗pdf ↗

In this note, we prove that smooth self-shrinkers in $\Real^{n+1}$, that are entire graphs, are hyperplanes. Previously Ecker and Huisken showed that smooth self-shrinkers, that are entire graphs and have at most polynomial growth, are hyperplanes. The point of this note is that no growth assumption at infinity is need…

2009-12-09abs ↗pdf ↗

The study constructs non-invariant H-graphs in hyperbolic space with specific asymptotic boundaries.

problem Finding non-trivial entire graphs with specific asymptotic boundaries in hyperbolic space.
method Constructing entire H-graphs with parabolic asymptotic boundaries in H2imesR\mathbb{H}^2 imes\mathbb{R}.
result The existence of entire H-graphs with parabolic asymptotic boundaries, not invariant by isometries.

Unlike R3\mathbb{R}^{3}, the homogeneous spaces E(1,τ)\mathbb{E}(-1,τ) have a great variety of entire vertical minimal graphs. In this paper we explore conditions which guarantees that a minimal surface in E(1,τ)\mathbb{E}(-1,τ) is such a graph. More specifically: we introduce the definition of a generalized slab in $\mathbb{E…

2015-11-10abs ↗pdf ↗

We show that a properly immersed minimal hypersurface in M x R_+ equals some M x {c} when M is a complete, recurrent n-dimensional Riemannian manifold with bounded curvature. If on the other hand, M has nonnegative Ricci curvature with curvature bounded below, the same result holds for any positive entire minimal graph…

2012-06-15abs ↗pdf ↗

Minimal graphs grow slowly on curved spaces, proving constant solutions.

problem Characterizing minimal graphs with sublinear growth on manifolds.
method New technique to get gradient bounds by integral estimates, no further geometric assumptions.
result Entire solutions are constant when negative part grows like r/logrr/\log r.

Improves Bernstein theorem for space-like graphs in Lorentz-Minkowski space.

problem Proves a new Bernstein-type theorem for space-like zero mean curvature graphs.
method Uses fluid mechanical duality between minimal surfaces and maximal surfaces.
result Shows that a zero mean curvature graph with only space-like and light-like points is a plane.

Paper finds space-like maximal surfaces with entire null lines in 3D space-time.

problem Existence of space-like maximal surfaces containing entire null lines.
method Analyzes surfaces in Lorentz-Minkowski 3-space, proving existence and properties.
result Embedded space-like maximal graphs containing entire null lines exist.

The paper solves a curvature equation for a specific spacetime foliation.

problem Characterizing foliations in a Generalized Robertson-Walker spacetime.
method Analyzing a mean curvature equation on spacelike graphs.
result All entire solutions of the curvature equation are found.

Develops a duality for graphs in Riemannian and Lorentzian spaces with prescribed mean curvature.

problem Finding graphs with prescribed mean curvature in Riemannian and Lorentzian spaces.
method Introduces a conformal duality that swaps mean curvature and bundle curvature, invariant to base surface and reciprocal of the Killing vector field length.
result Entire graphs in Lorentz-Minkowski space with prescribed mean curvature a bounded function H.

Shapley Flow interprets model predictions using a graph-based approach to feature importance.

problem Existing feature importance methods ignore or hide feature dependencies.
method Shapley Flow considers the entire causal graph and assigns credit to edges.
result Shapley Flow provides a deeper, graph-based view of feature importance.

The aim of this work is studying translating graphs by mean curvature flow in $\Real^3$. We prove non-existence of complete translating graphs over bounded domains in $\Real^2$. Furthermore, we show that there are only three types of complete translating graphs in $\Real^3$; entire graphs, graphs between two vertical p…

2012-12-27abs ↗pdf ↗

Integrates learning and optimization on graphs, improving prediction accuracy.

problem Combining learning and optimization on graphs with partially observed data.
method Proposes a decision-focused learning approach integrating a differentiable proxy for optimization problems.
result ClusterNet system outperforms pure end-to-end and standard approaches.