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

Trend · papers per month

67134200267 · Jun 202019922001200920182026
48 results for Cousin graphs

Newly discovered 5 triangle-free intrinsically knotted graphs with 22 edges.

problem Identifying intrinsically knotted graphs with specific properties.
method Analyzing graphs with 22 edges, using specific graph operations and properties.
result There are exactly five triangle-free intrinsically knotted graphs with 22 edges.

A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, K7K_7 and the 13 graphs obtained from K7K_7 by Y\nabla Y moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set incl…

2014-11-07abs ↗pdf ↗

Efficiently accelerates Feldman-Cousins method using Gaussian processes.

problem Slow computation of confidence intervals in high-energy physics.
method Gaussian process acceleration of Feldman-Cousins method.
result Confidence intervals can be computed 5-10 times faster with similar accuracy.

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that K7K_7 and the 13 graphs obtained from K7K_7

2014-07-13abs ↗pdf ↗

We investigate the close relationship between minimal surfaces in Euclidean 3-space and constant mean curvature 1 surfaces in hyperbolic 3-space. Just as in the case of minimal surfaces in Euclidean 3-space, the only complete connected embedded constant mean curvature 1 surfaces with two ends in hyperbolic space are we…

2008-04-26abs ↗pdf ↗

In this paper we shall establish that properly embedded constant mean curvature one surfaces in H^3 of finite topology are of finite total curvature and each end is regular. In particular, this implies the horosphere is the only simply connected such example, and the catenoid cousins the only annular examples of this n…

2001-05-01abs ↗pdf ↗

In this paper we study the maximal stable domains on minimal catenoids in Euclidean and hyperbolic spaces and in H2×RH^2 \times R. We in particular investigate whether half-vertical catenoids are maximal stable domains (\emph{Lindelöf's property}). We also consider stable domains on catenoid-cousins in hyperbolic space. …

2009-07-24abs ↗pdf ↗

This preliminary report studies immersed surfaces of constant mean curvature in H3H^3 through their {\it adjusted Gauss maps} (as harmonic maps in S2S^2) and their {\it adjusted frames} in SU(2). Lawson's correspondence between Euclidean CMC surfaces and their hyperbolic cousins is interpreted here under a different pe…

2003-03-26abs ↗pdf ↗

Witten's approach to Khovanov homology of knots is based on the five-dimensional system of partial differential equations, which we call Haydys-Witten equations. We argue for a one-to-one correspondence between its solutions and solutions of the seven-dimensional system of equations. The latter can be formulated on any…

2014-03-26abs ↗pdf ↗

We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (R. C. Heitmann, C. Radin, J. Stat. Phys. 22, 281-287, 1980), which concerns a system of NN identical at…

2016-04-29abs ↗pdf ↗

The Steklov problem is an eigenvalue problem with the spectral parameter in the boundary conditions, which has various applications. Its spectrum coincides with that of the Dirichlet-to-Neumann operator. Over the past years, there has been a growing interest in the Steklov problem from the viewpoint of spectral geometr…

2014-11-24abs ↗pdf ↗

CV inference can be invalid for relatively unstable model comparisons.

problem The validity of cross-validation for model comparison is questioned when models are relatively unstable.
method The study proves that simple, individually stable models can generate relatively unstable comparisons, invalidating CV inference.
result The Lasso and soft-thresholding generate relatively unstable comparisons, invalidating CV inferences.

We prove that many complete, noncompact, constant mean curvature (CMC) surfaces f:ΣR3f:Σ\to \R^3 are nondegenerate; that is, the Jacobi operator Δf+Af2Δ_f + |A_f|^2 has no L2L^2 kernel. In fact, if ΣΣ has genus zero and f(Σ)f(Σ) is contained in a half-space, then we find an explicit upper bound for the dimension of the L2L^2 j…

2004-07-09abs ↗pdf ↗

New metrics for SPD matrices explore affine invariance and symmetry principles.

problem Choosing appropriate metrics for SPD matrices based on invariance principles.
method Investigates power-affine and deformed-affine metrics within a continuum of SPD metrics.
result Introduces new families of metrics based on affine invariance and symmetry.

Study on deformations of pre-symplectic structures using an L-infinity algebra.

problem Deformation theory of pre-symplectic structures.
method Parametrization of deformations using Koszul L-infinity algebra.
result A quotient of the Koszul L-infinity algebra is isomorphic to the L-infinity algebra controlling foliations.

Paper constructs solutions for a class of overdetermined systems.

problem Constructing solutions for a class of overdetermined systems.
method Resolution of the solution sheaf, sufficient condition for global exactness, gluing techniques, local solvability of the Treves complex.
result Obtained a sufficient condition for global exactness, leading to gluing techniques for local solutions.

Transformers predict scattering amplitudes in theoretical physics.

problem Computing exact coefficients of scattering amplitudes in N = 4 SYM theory.
method Applied Transformers to predict integer coefficients of scattering amplitudes.
result Transformers achieve high (> 98%) accuracy on predicting scattering amplitudes.

Nonlinear analysis has played a prominent role in the recent developments in geometry and topology. The study of the Yang-Mills equation and its cousins gave rise to the Donaldson invariants and more recently, the Seiberg-Witten invariants. Those invariants have enabled us to prove a number of striking results for low …

2002-12-01abs ↗pdf ↗

We study how finite Bayesian neural networks adapt their hidden representations.

problem Understanding how finite Bayesian neural networks differ from infinite ones.
method We analyze the asymptotics of learned feature kernels for various network architectures.
result The leading finite-width corrections to feature kernels have a universal form.

Scaling relations, such as the IPAT equation and the Kaya identity, are useful for quickly gauging the scale of economic, technological, and demographic changes required to reduce environmental impacts and pressures; in the case of the Kaya identity, the environmental pressure is greenhouse gas emissions. However, when…

2011-12-04abs ↗pdf ↗

We show that the index of a constant mean curvature 1 surface in hyperbolic 3-space is completely determined by the compact Riemann surface and secondary Gauss map that represent it in Bryant's Weierstrass representation. We give three applications of this observation. Firstly, it allows us to explicitly compute the in…

2008-06-29abs ↗pdf ↗

Let VV be a complex algebraic hypersurface defined by a polynomial ff with Newton polytope ΔΔ. It is well known that the spine of its amoeba has a structure of a tropical hypersurface. We prove in this paper that there exists a complex tropical hypersurface V,fV_{\infty, f} such that its coamoeba is homeomorphic to t…

2009-06-15abs ↗pdf ↗

Machine learning and statistical modeling complement each other in healthcare analytics.

problem Choosing between machine learning and statistical modeling for analytics challenges.
method Choosing based on problem, data, and desired outcomes.
result Machine learning and statistical modeling are complementary, using similar principles but different tools.

We propose the Bayesian bridge estimator for regularized regression and classification. Two key mixture representations for the Bayesian bridge model are developed: (1) a scale mixture of normals with respect to an alpha-stable random variable; and (2) a mixture of Bartlett--Fejer kernels (or triangle densities) with r…

2011-09-11abs ↗pdf ↗

Generative AI can solve in-context learning problems using a martingale perspective.

problem Estimating when a conditional generative model can solve an in-context learning problem.
method Bayesian interpretation, ancestral sampling, generative predictive p-value.
result Developed a method to assess the suitability of CGMs for ICL problems using generative predictive p-values.

The Weyl problem is extended to hyperbolic and anti-de Sitter spaces, connecting geometry, analysis, and group theory.

problem The classical Weyl problem for surfaces in hyperbolic and anti-de Sitter spaces.
method Generalizations of the Weyl problem to unbounded convex subsets and convex surfaces, focusing on thin and thick asymptotic boundaries.
result Connections to Kleinian groups, complex analysis, circle packings, and grafting on the hyperbolic disk.

Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.

problem Limited theoretical understanding of line graph transformation's impact on GNN models.
method Examined CFI and strongly regular graphs, showing line graph transformation helps WL tests distinguish these graphs.
result Line graph transformation aids WL tests in distinguishing challenging graph properties.

Proposes MGMN for end-to-end graph similarity learning.

problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.