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

Trend · papers per month

71142212283 · Jun 202019922001200920172026
48 results for multiple junction

Paper studies curvature of stable surfaces meeting at a common boundary.

problem Stable multiple junction surfaces and their curvature estimates.
method Derived LpL^p estimate of curvature for stable multiple junction surfaces.
result Bernstein Theorem holds for stable multiple junction surfaces in certain cases.

Study proves existence of expanding solutions for multiphase surfaces with regular junctions.

problem Existence of self-similar expanding solutions for multiphase surfaces with regular junctions.
method Proves existence of solutions for a multiphase surface with regular junctions using mean curvature flow.
result Multiple self-similar expanding solutions exist for the initial condition of a multiphase surface with regular junctions.

The paper proves a regularity theorem for Brakke flows near triple junctions.

problem Understanding the structure of triple junctions in Brakke flows.
method Establishes the ε-regularity theorem for k-dimensional Brakke flows near static, multiplicity-one triple junctions.
result The regular structure of triple junctions persists under weak mean curvature flow.

An undirected graphical model is a joint probability distribution defined on an undirected graph G*, where the vertices in the graph index a collection of random variables and the edges encode conditional independence relationships among random variables. The undirected graphical model selection (UGMS) problem is to es…

2013-04-17abs ↗pdf ↗

Constructs perturbations of a minimal surface with triple junctions.

problem Minimal surfaces with triple junctions in curved spaces.
method Constructs stationary perturbations with given boundary conditions.
result Constructs minimal surfaces with triple junctions in R2imesS1\mathbb{R}^2 imes \mathbb{S}^1.

Uniformizes surfaces with boundaries, focusing on triple junctions.

problem Uniformization of surfaces with boundaries, especially triple junctions.
method Extends conformal structure results to triple junction surfaces.
result Weak uniformization results for triple junction surfaces.

We study elliptic fibrations by analyzing suitable deformations of the fibrations and vanishing cycles. We introduce geometric string junctions and describe some of their properties. We show how the structure of the geometric string junctions is naturally related to the Lie algebra structures of the associated singular…

2014-10-24abs ↗pdf ↗

We seek to automate the design of molecules based on specific chemical properties. In computational terms, this task involves continuous embedding and generation of molecular graphs. Our primary contribution is the direct realization of molecular graphs, a task previously approached by generating linear SMILES strings …

2018-02-12abs ↗pdf ↗

We prove that on a closed surface, for any c>0c>0, our min-max theory for prescribing mean curvature produces a solution given by a curve of constant geodesic curvature cc which is almost embedded, except for finitely many points, at which the solution is a stationary junction with integer density. Moreover, each smoot…

2018-11-09abs ↗pdf ↗

Proves existence and uniqueness of curvature motion for regular networks.

problem Existence and uniqueness of motion by curvature for regular networks.
method Proves existence and uniqueness using $W^{2- rac{2}{p}}_p$ initial data and investigates regularization effects.
result Proves existence and uniqueness of motion by curvature for regular networks.

Energy-efficient sampling for machine learning using magnetic tunnel junctions.

problem Costly and inefficient random sampling in machine learning.
method Energy-efficient algorithm using stochastic magnetic tunnel junctions for uniform Float16 sampling.
result Higher energy efficiency than state-of-the-art algorithms, with a minimum factor of 9721.

We show how networks of Wilson lines realize quantum groups U_q(sl(m)), for arbitrary m, in 3d SU(N) Chern-Simons theory. Lifting this construction to foams of surface operators in 4d theory we find that rich structure of junctions is encoded in combinatorics of planar diagrams. For a particular choice of surface opera…

2015-07-22abs ↗pdf ↗

Chaos in cerebellar cells enhances complexity of neural patterns.

problem Understanding how cerebellar granular layer represents complex information.
method Constructed a model of cerebellar granular layer with gap junctions, evaluated using reservoir computing.
result Chaotic dynamics in the cerebellar granular layer produce complex and diverse output patterns.

Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies predominantly on local search heuristics such as Expectation Maximization. Using te…

2012-10-16abs ↗pdf ↗

Plateau's problem is to show the existence of an area minimizing surface with a given boundary, a problem posed by Lagrange in 1760. Experiments conducted by Plateau showed that an area minimizing surface can be obtained in the form of a film of oil stretched on a wire frame, and the problem came to be called Plateau's…

2011-06-29abs ↗pdf ↗

The goal of this project is to introduce and present a machine learning application that aims to improve the quality of life of people in Singapore. In particular, we investigate the use of machine learning solutions to tackle the problem of traffic congestion in Singapore. In layman's terms, we seek to make Singapore …

2018-09-05abs ↗pdf ↗

The paper proves stability and convergence of minimal networks under curvature motion.

problem Stability and convergence of minimal networks under curvature motion.
method Proved Lojasiewicz-Simon gradient inequalities for minimal networks.
result Motion by curvature starting from networks close to minimal ones exists for all times and smoothly converges.

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

2010-07-04abs ↗pdf ↗

Mean curvature flow of clusters of n-dimensional surfaces in R^{n+k} that meet in triples at equal angles along smooth edges and higher order junctions on lower dimensional faces is a natural extension of classical mean curvature flow. We call such a flow a mean curvature flow with triple edges. We show that if a smoot…

2016-05-21abs ↗pdf ↗

We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some properties of the minimal configurations.

2017-12-27abs ↗pdf ↗

A new framework for efficient Bayesian network inference.

problem High-dimensional Bayesian networks are hard to infer due to computational scaling.
method Directed convex subgraphs and minimal d-decomposition tree for decomposition, enabling parallel computation.
result The method reduces computational cost and enables parallel computation.

We minimize a linear combination of the Willmore and the length functional among networks in Rd\mathbb{R}^d belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the junctions. Since this class lacks compactness, we characterize the set of limits of s…

2019-09-13abs ↗pdf ↗

A new neural network model for molecular graphs that learns efficiently and accurately.

problem Learning on molecular graphs with cycles and complex structures.
method Hierarchical inter-message passing using raw graph and junction tree representations.
result The model outperforms classical GNNs in detecting cycles and is efficient to train.

We study the curvature flow of planar nonconvex lens-shaped domains, considered as special symmetric networks with two triple junctions. We show that the evolving domain becomes convex in finite time; then it shrinks homothetically to a point. Our theorem is the analog of the result of Grayson for curvature flow of clo…

2009-05-31abs ↗pdf ↗

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

We consider the existence problem for `Steiner networks' (trivalent graphs with 120 degree angles at each junction) in strictly convex domains, with `Neumann' boundary conditions (orthogonal intersection with the domain boundary.) For each of the three possible combinatorial possibilities, sufficient conditions on the …

2008-06-03abs ↗pdf ↗

We propose a targeted communication architecture for multi-agent reinforcement learning, where agents learn both what messages to send and whom to address them to while performing cooperative tasks in partially-observable environments. This targeting behavior is learnt solely from downstream task-specific reward withou…

2018-10-26abs ↗pdf ↗

We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth until the lengths of the three curves stay far from zero. If this is the case for all times, then the evolution exists…

2013-01-15abs ↗pdf ↗