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,742 papers · 148 categories

Trend · papers per month

163327490653 · Jun 202019922001200920172026
48 results for Graph Conditional Flow

The paper proves uniqueness of evolving graphs by mean curvature flow under specific conditions.

problem Proving uniqueness of entire graphs evolving by mean curvature flow.
method Analyzes graphs of locally Lipschitz functions and rotationally symmetric solutions, proving uniqueness under uniform lower bounds and proper graphs.
result Uniqueness of entire graphs evolving by mean curvature flow under specified conditions.

Estimates prove existence of curvature flow in curved spaces.

problem Mean curvature flow in curved spaces with boundary conditions.
method A priori estimates and existence proof for curvature flow.
result Existence of curvature flow with asymptotic Dirichlet conditions.

In this note we study a large class of mean curvature type flows of graphs in product manifold N×RN\times R where N is a closed Riemann- ian manifold. Their speeds are the mean curvature of graphs plus a prescribed function. We establish long time existence and uniformly convergence of those flows with a barrier conditi…

2017-12-19abs ↗pdf ↗

Paper proves stability of flow in cotangent bundle for special Lagrangian submanifolds.

problem Stability of generalized Lagrangian mean curvature flow in cotangent bundle.
method New derivative estimates to weaken initial conditions and remove curvature constraints.
result Stability of flow near special Lagrangian submanifolds in cotangent bundle.

Statistical generative models for molecular graphs attract attention from many researchers from the fields of bio- and chemo-informatics. Among these models, invertible flow-based approaches are not fully explored yet. In this paper, we propose a powerful invertible flow for molecular graphs, called graph residual flow…

2019-09-30abs ↗pdf ↗

MoFlow generates chemically valid molecular graphs from latent representations.

problem Generating chemically valid molecular graphs from latent representations is challenging.
method MoFlow uses a flow-based approach with Glow for bond generation and a novel graph conditional flow for atom generation, ensuring chemical validity and efficiency.
result MoFlow achieves state-of-the-art performance in molecular graph generation and optimization.

We consider mean curvature flow of an initial surface that is the graph of a function over some domain of definition in RnR^n. If the graph is not complete then we impose a constant Dirichlet boundary condition at the boundary of the surface. We establish longtime-existence of the flow and investigate the projection of…

2016-04-18abs ↗pdf ↗

DECAF optimizes molecular graphs for ensemble properties, improving drug design accuracy.

problem Designing molecules with ensemble properties rather than single conformations.
method DECAF uses Boltzmann-expected design with decoupled annealing flows to optimize molecular graphs.
result DECAF optimizes molecular graphs to shift ensemble properties towards targets, improving accuracy over single-conformer methods.

Let MM be a complete Riemannian manifold which either is compact or has a pole, and let φ\varphi be a positive smooth function on MM. In the warped product M×φRM\times_\varphi\mathbb R, we study the flow by the mean curvature of a locally Lipschitz continuous graph on MM and prove that the flow exists for all time an…

2009-06-16abs ↗pdf ↗

The study connects geodesic flows on Riemann surfaces to random walks on their dual graphs.

problem Understanding ergodicity of geodesic flows on infinite Riemann surfaces.
method Analyzing random walks on the dual graph of pants decompositions.
result Equivalence between ergodicity of geodesic flows and recurrence of random walks.

Study proves mean curvature flow in GRW spacetimes with perpendicular boundary condition.

problem Longtime existence of mean curvature flow in GRW spacetimes.
method Proved longtime existence using perpendicular Neumann boundary condition and null convergence condition.
result Metric of solution is conformal to GRW leaf's metric in asymptotic time.

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.

In this paper we study nonparametric mean curvature type flows in M×RM\times\mathbb{R} which are represented as graphs (x,u(x,t))(x,u(x,t)) over a domain in a Riemannian manifold MM with prescribed contact angle. The speed of uu is the mean curvature speed minus an admissible function ψ(x,u,Du)ψ(x,u,Du). Long time existence and unif…

2017-02-08abs ↗pdf ↗

Graphs with nonnegative Bakry-Émery curvature have volume doubling and Poincaré inequalities.

problem Proving properties of graphs with specific curvature conditions.
method Graph-theoretic modified nonlinear heat-flow method, including point-mass consequences and diffusive exit-time control.
result Volume doubling and Poincaré inequalities for graphs with nonnegative Bakry-Émery curvature.

MLPF uses graph neural networks to improve particle-flow reconstruction in high-pileup conditions.

problem Improving particle-flow reconstruction in high-pileup conditions at high-luminosity LHC.
method End-to-end trainable machine-learned particle-flow algorithm based on graph neural networks.
result MLPF improves physics response and demonstrates scalable reconstruction in high-pileup environments.

We introduce vine computational graphs for efficient ML integration of vine copulas.

problem Integrating vine copulas into modern machine learning pipelines.
method Developed vine computational graphs and algorithms for conditional sampling, scheduling, and structure construction.
result Gradient flow through vine copulas improves performance in machine learning models.

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 define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …

2010-07-06abs ↗pdf ↗

iGNN tackles inverse graph prediction using invertible neural networks.

problem Inverse graph prediction problem in data analysis and machine learning.
method Developed invertible graph neural network (iGNN) to solve inverse prediction problem on graphs.
result iGNN model allows efficient generation from output labels and forward prediction.

We recall the construction of the Kontsevich graph orientation morphism γOr(γ)γ\mapsto {\rm O\vec{r}}(γ) which maps cocycles γγ in the non-oriented graph complex to infinitesimal symmetries P˙=Or(γ)(P)\dot{\mathcal{P}} = {\rm O\vec{r}}(γ)(\mathcal{P}) of Poisson bi-vectors on affine manifolds. We reveal in particular why there alw…

2018-11-19abs ↗pdf ↗

GANF uses normalizing flows to detect anomalies in multiple time series.

problem Detecting anomalies in multiple time series with interdependencies.
method Bayesian network integration with normalizing flows for unsupervised anomaly detection.
result GANF effectively detects anomalies and identifies distribution drift in time series data.

Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area-decreasing map between unit spheres (of possibly different dimensions) is homotopic to a constant…

2003-02-19abs ↗pdf ↗

New method shows pseudo-Anosov flows on graph manifolds can be simplified.

problem Understanding pseudo-Anosov flows on graph manifolds.
method Constructing a partial Birkhoff section with genus one components that misses finitely many closed orbits.
result Every pseudo-Anosov flow on a graph manifold is almost equivalent to a totally periodic flow or a suspension Anosov flow.

A novel spatio-temporal graph neural network with a learnable Tweedie head improves vessel traffic flow prediction in sparse maritime data.

problem Accurate vessel traffic flow prediction in sparse maritime data.
method A model-agnostic learnable Tweedie head attached to ST-GNN backbones.
result The proposed head consistently improves RMSE across multiple ST-GNN backbones, especially on non-zero events.

Study curve shortening flows on specific surfaces, proving properties and existence.

problem Analyzing curve shortening flows on rotational surfaces with negative Gauss curvatures.
method Assume negative Gauss curvatures and conditions on Gauss curvature and curve curvature. Prove curve remains a graph and establish flow properties.
result Prove the curve remains a graph over parallels and establish long-time existence of the flow.

Study of mean curvature flows on graphs in warped product manifolds, focusing on behavior at infinity.

problem Behavior of mean curvature flows on graphs in warped product manifolds, especially at infinity.
method Analysis of curve shortening flow and mean curvature flow on geodesic graphs for various warping functions.
result Long-time existence of mean curvature flows and vanishing of curvature and derivatives at infinity.

We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs. In the unsupervis…

2019-05-30abs ↗pdf ↗

The paper introduces a new type of Ricci flow on graphs to study their curvature.

problem Understanding the curvature of graphs and their convergence properties.
method Proposes a weighted Forman and Lin-Lu-Yau Ricci flow on graphs and proves the existence and uniqueness of solutions.
result The normalized curvature flow on trees converges to a constant curvature metric.

Graph Ricci flow reveals hidden hierarchies in stock market correlations.

problem Detecting hidden structures in the complex stock market graph.
method Using graph Ricci curvature and flow techniques to analyze the NASDAQ 100 index.
result Algorithm detects hidden hierarchies, community behavior, and clustering in financial markets.

Study shows how to preserve Lagrangian condition in mean curvature flow on Kim-McCann metrics.

problem Preserving Lagrangian condition in mean curvature flow on Kim-McCann metrics.
method Expressed mean curvature flow within generalized mean curvature flow framework.
result Lagrangian condition is preserved along the flow.