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

20406080 · Jun 202019922001200920172026
48 results for balanced vertices

A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.

problem Constructing geodesic nets with specific vertex types and properties.
method Novel approach to increase the number of balanced vertices from 16 to 25.
result First net with four boundary vertices and 25 balanced vertices, including non-symmetric balanced vertices.

The existence of a balanced vertex is proven for geodesic nets with three boundary vertices.

problem Existence of a balanced vertex in geodesic nets with specific boundary conditions.
method Proof of existence on a general two-dimensional Riemannian surface.
result Existence of a balanced vertex for geodesic nets with three unbalanced boundary vertices.

We determine the minimum number of vertices needed to provide balanced triangulations of Sd2\mathbb S^{d-2}-bundles over S1\mathbb S^1. If dd is odd and the bundle is orientable, or dd is even and the bundle is non-orientable, the minimum number of vertices is 3d3d; otherwise, it is 3d+23d+2. Similar results apply to al…

2015-05-21abs ↗pdf ↗

We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be new even in the Euclidean case. We demonstrate by examples that the result is not …

2018-03-10abs ↗pdf ↗

In this work we show that the systems of balance equations (balance systems) of continuum thermodynamics occupy a natural place in the variational bicomplex formalism. We apply the vertical homotopy decomposition to get a local splitting (in a convenient domain) of a general balance system as the sum of a Lagrangian pa…

2011-01-27abs ↗pdf ↗

Researchers create new triply periodic minimal surfaces by gluing saddle towers.

problem Creating triply periodic minimal surfaces without symmetry constraints.
method Gluing Karcher-Scherk saddle towers with phase differences and balancing under vertical interaction.
result Expands known triply periodic minimal surfaces into new 5-parameter families.

Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean plane or the round 22-sphere. In the first half of this paper we survey some r…

2019-03-31abs ↗pdf ↗

Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation…

2019-05-11abs ↗pdf ↗

We start with a disk with 2n2n vertices along its boundary where pairs of vertices are connected with nn strips with certain restrictions. This forms a {\it pairing}. To relate two pairings, we define an operator called a cut-and-glue operation. We show that this operation does not change an invariant of pairings know…

2019-10-25abs ↗pdf ↗

A new framework for clustering high-dimensional data using vertical shards.

problem Clustering high-dimensional data with the curse of dimensionality.
method Vertical Consensus Inference (VCI) that splits data into vertical shards for posterior inference.
result VCI can approximate inference on random partitions for high-dimensional data.

New study shows limits of low-degree algorithms in finding large independent sets in sparse hypergraphs.

problem Finding large independent sets in sparse random hypergraphs.
method Low-degree polynomial algorithms are analyzed to determine their limits.
result Low-degree algorithms can find independent sets of density up to \(\left(\frac{\log d}{(r-1)d} ight)^{1/(r-1)}\), but no larger.

DeepSphere improves spherical CNNs by balancing efficiency and rotation equivariance.

problem Designing efficient and rotation-equivariant convolutional layers for spherical data.
method Graph-based approach to represent spherical data, focusing on the number of vertices and neighbors.
result DeepSphere achieves state-of-the-art performance and demonstrates efficiency and flexibility.

There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined question of how many vertices that will be misclassified on average. We consider the binary form of the stochastic block model, where nn ver…

2015-09-10abs ↗pdf ↗

We employ a solution of the Yang-Baxter equation to construct invariants for knot-like objects. Specifically, we consider a Yang-Baxter state model for the sl(n) polynomial of classical links and extend it to oriented singular links and balanced oriented 4-valent knotted graphs with rigid vertices. We also define a rep…

2014-06-15abs ↗pdf ↗

In this paper, we characterize Riemannian 4-manifold in terms of its almost Hermitian twistor spaces (Z,gt,J±)(Z,g_t,\mathbb{J}_{\pm}). Some special metric conditions (including Balanced metric condition, first Gauduchon metric condition) on (Z,gt,J±)(Z,g_t,\mathbb{J}_{\pm}) are studied. For the first Chern form of a natural unitary…

2014-03-12abs ↗pdf ↗

New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.

problem Understanding and detecting core-periphery structures in graphs with community structure.
method Introduces relative centrality to detect cores in graphs with community and core-periphery structures.
result Relative centrality solves bias issues in core detection, leading to better vertex selection and improved clustering performance.

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…

2003-09-04abs ↗pdf ↗

Researchers create minimal surfaces with Scherk ends and find catenoid limits.

problem Constructing minimal surfaces with specific end types and understanding their limits.
method Constructing families of embedded, singly periodic minimal surfaces with Scherk-type ends and analyzing their limits.
result The limit of the constructed surfaces are catenoid necks connecting planes, determined by Stieltjes polynomials.

Study on relativistic nonholonomic mechanics with time-dependent constraints.

problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.

Efficient algorithm for graph matching in correlated stochastic block models.

problem Graph matching in correlated stochastic block models with balanced communities.
method Extends previous work on centered subgraph counts to handle estimation errors and edge correlation.
result First efficient algorithm for graph matching in the logarithmic average degree regime, matching all but a vanishing fraction of vertices with high probability.

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S2×S1S^2\times S^1 and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres…

2006-04-02abs ↗pdf ↗

The string vertices of closed string field theory are subsets of the moduli spaces of punctured Riemann surfaces that satisfy a geometric version of the Batalin-Vilkovisky master equation. We present a homological proof of existence of string vertices and their uniqueness up to canonical transformations. Using hyperbol…

2019-08-30abs ↗pdf ↗

We prove the existence of a complete, embedded, singly periodic minimal surface, whose quotient by vertical translations has genus one and two ends. The existence of this surface was announced in our paper in {\it Bulletin of the AMS}, 29(1):77--84, 1993. Its ends in the quotient are asymptotic to one full turn of the …

1996-05-17abs ↗pdf ↗

We prove that any complete surface with constant mean curvature in a homogeneous space E(κ,τ) which is transversal to the vertical Killing vector field is, in fact, a vertical graph. As a consequence we get that any orientable, parabolic, complete, immersed surface with constant mean curvature H in E(κ,τ) (different fr…

2012-06-07abs ↗pdf ↗

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

problem Uncertainty in measuring aerosol vertical distributions due to limited observations.
method Bayesian nonparametric Gaussian process modeling using meteorological predictors.
result Model reconstructs realistic extinction profiles with well-calibrated uncertainty, outperforming idealized baselines.

Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures. On the other hand, kernels that do take global graph propertiesinto account may not scale well to large graph databases.…

2017-03-07abs ↗pdf ↗

Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph matching methods can be applied directly to recover the missing correspondences,…

2017-05-01abs ↗pdf ↗

We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine hh-vector of balanced semi-Eulerian complexes and the toric hh-vector of semi-Eulerian posets. The lower bounds on simplicial h…

2007-09-25abs ↗pdf ↗

Classifies 3-manifolds from simplified (2,0)-trisections of 4-manifolds.

problem Classifying 3-manifolds from simplified (2,0)-trisections of 4-manifolds.
method Classifies vertical 3-manifolds as preimages of arcs on the plane for simplified (2,0)-trisection maps.
result Each 6-tuple of vertical 3-manifolds determines the source 4-manifold uniquely up to orientation reversing diffeomorphisms.

Deep linear networks exhibit collapsing features and classifiers across datasets.

problem Understanding the collapse of features and classifiers in deep linear networks.
method Theoretical and empirical analysis of deep linear networks with MSE and CE losses.
result Deep linear networks exhibit NC properties, collapsing features and classifiers to orthogonal vectors.

The paper examines vertical curves and fibers in the Heisenberg group, proving properties and constructing counterexamples.

problem Characterizing and measuring vertical curves and fibers in the Heisenberg group.
method Metric analysis of vertical curves and fibers of maps from the Heisenberg group to the plane.
result Vertical curves in the Heisenberg group can have Hausdorff dimensions strictly larger or smaller than 2, unlike intrinsic Lipschitz graphs.

P. Arnoux and A. Marin showed that any triangulation of RPn\mathbb{RP}^n contains more than (n+1)(n+2)2\frac{(n+1)(n+2)}{2} vertices if n3n \geq 3. We construct some natural triangulation of RPn\mathbb{RP}^n with n(n+5)21\frac{n(n+5)}{2}-1 vertices for all n3n \geq 3. Previously, it was known that RPn\mathbb{RP}^n has Z2n\mathbb{Z}_2^n-e…

2014-03-02abs ↗pdf ↗

Asynchronous federated learning for vertically partitioned data improves efficiency and privacy.

problem Efficiently train models on vertically partitioned data without a trusted third party.
method Proposed AFSGD-VP and its SVRG and SAGA variants for asynchronous federated learning.
result AFSGD-VP and its variants achieve higher efficiency than synchronous algorithms.

We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with finite fundamental group are the only surfaces in which every simple closed curve ha…

2010-06-21abs ↗pdf ↗

An unknotting tunnel in a 3-manifold with boundary is a properly embedded arc, the complement of an open neighborhood of which is a handlebody. A geodesic with endpoints on the cusp boundary of a hyperbolic 3-manifold and perpendicular to the cusp boundary is called a vertical geodesic. Given a vertical geodesic in a h…

2012-05-23abs ↗pdf ↗

The study shows how to construct dd-spheres from (d1)(d-1)-spheres and dd-balls without additional vertices.

problem Constructing dd-spheres from (d1)(d-1)-spheres and dd-balls without additional vertices.
method Examining specific types of spheres (flag, stacked, join of spheres) and dd-balls to determine if constructions can be made without extra vertices.
result Affirmative answers to constructing dd-spheres from (d1)(d-1)-spheres and dd-balls without additional vertices for certain types of spheres and dd-balls.