Study on functional inequalities on simple edge spaces.
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.
Trend · papers per month
Spectral clustering with edge counting detects communities in sparse models.
Let be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold. We calculate the various polynomially weighted de Rham cohomology spaces of , as well as the associated spac…
New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.
Geodesic loops on tetrahedra are studied in spherical and hyperbolic spaces.
We show that the singularities of spacelike maximal surfaces in Lorentz-Minkowski 3-space generically consist of cuspidal edges, swallowtails and cuspidal cross caps. The same result holds for spacelike mean curvature one surfaces in de Sitter 3-space. To prove these, we shall give a simple criterion for a given singul…
This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a finite depth graph of groups is one whose vertex and edge groups are coarse Poinca…
Previous work in network analysis has focused on modeling the mixed-memberships of node roles in the graph, but not the roles of edges. We introduce the edge role discovery problem and present a generalizable framework for learning and extracting edge roles from arbitrary graphs automatically. Furthermore, while existi…
Statistical inference on graphs is a burgeoning field in the applied and theoretical statistics communities, as well as throughout the wider world of science, engineering, business, etc. In many applications, we are faced with the reality of errorfully observed graphs. That is, the existence of an edge between two vert…
POET enables large neural network training on tiny devices with reduced energy.
New property: polygons have a fixed dimension regardless of ambient space dimensions.
Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.
This paper interprets critical scales in persistent homology for compact metric spaces.
This paper optimizes object tracking on edge devices with small matrices.
This paper and its companion arXiv:1002.4564 have been replaced by arXiv:1602.05139. We give a general simple definition of JSJ decompositions by means of a universal maximality property. The JSJ decomposition should not be viewed as a tree (which is not uniquely defined) but as a canonical deformation space of trees. …
The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…
Under what conditions is an edge present in a social network at time t likely to decay or persist by some future time t + Delta(t)? Previous research addressing this issue suggests that the network range of the people involved in the edge, the extent to which the edge is embedded in a surrounding structure, and the age…
EDG generates Boltzmann samples from latent variables efficiently.
Along cuspidal edge singularities on a given surface in Euclidean 3-space, which can be parametrized by a regular space curve, a unit normal vector field is well-defined as a smooth vector field of the surface. A cuspidal edge singular point is called generic if the osculating plane of the cuspidal edge (as a regul…
In L^3, cuspidal edges can have bounded mean curvature under specific conditions.
We study the topology of the tropical moduli space parametrizing stable tropical curves of genus g with n marked points in which the bounded edges have total length 1, and prove that it is highly connected. Using the identification of this space with the dual complex of the boundary in the moduli space of stable algebr…
Graph attention improves node classification by distinguishing important edges.
Study Dirac operators on incomplete cusp edge spaces, proving self-adjointness and Fredholm properties.
Method solves optimisation problems on non-Riemannian surfaces with bilateral curvature bounds.
We prove that a certain class of ALE spaces always has a Kahler conformal compactification, and moreover provide explicit formulas for the conformal factor and the Kahler potential of said compactification. We then apply this to give a new and simple construction of the canonical Bochner-Kähler metric on certain weight…
Researchers develop a method to interpret GNNs by identifying unnecessary edges in NLP models.
We study the spectral geometric properties of the scalar Laplace-Beltrami operator associated to the Weil-Petersson metric on , the Riemann moduli space of surfaces of genus . This space has a singular compactification with respect to , and this metric has crossing…
The paper describes relations between Liouville type theorems for solutions of a periodic elliptic equation (or a system) on an abelian cover of a compact Riemannian manifold and the structure of the dispersion relation for this equation at the edges of the spectrum. Here one says that the Liouville theorem holds if th…
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph is a knotted loop, then there exists a plane diagram of such that (i) each edge of is represented…
A new ODE model explains gradient descent dynamics near edge of stability.
Origami edge-paths connect coherent curves on surfaces.
The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geom…
Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…
Study on planar graph braid groups' second homology.
This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight distribution matrix to the s…
A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space models provide a natural statistical framework for graph visualizing and clustering. A latent space model of particular interest is the Rando…
We address the problem of computing a single linkage dendrogram. A possible approach is to: (i) Form an edge weighted graph over the data, with edge weights reflecting dissimilarities. (ii) Calculate the MST of . (iii) Break the longest edge of thereby splitting it into subtrees , . (iv) Apply …
We establish existence of the eta-invariant as well as of the Atiyah-Patodi-Singer and the Cheeger-Gromov rho-invariants for a class of Dirac operators on an incomplete edge space. Our analysis applies in particular to the signature, the Gauss-Bonnet and the spin Dirac operator. We derive an analogue of the Atiyah-Pato…
Research explores hyperbolic space groups and their fundamental domains.
Orpheus simplifies deep learning deployment on edge devices.
We give useful and simple criteria for determining D_4 singularities of wave fronts. As an application, we investigate behaviors of singular curvatures of cuspidal edges near D_4^+ singularities.
Paper determines Assouad-Nagata dimension for all minor-closed metrics.
The abstract proves polygon inscriptions in curves with specific edge ratios.
We consider the weighted belief-propagation (WBP) decoder recently proposed by Nachmani et al. where different weights are introduced for each Tanner graph edge and optimized using machine learning techniques. Our focus is on simple-scaling models that use the same weights across certain edges to reduce the storage and…
Discrete knot theory models use lattice-filtered graphs to detect merging knot components.
We derive a formula for the index of a Dirac operator on a compact, even-dimensional incomplete edge space satisfying a "geometric Witt condition". We accomplish this by cutting off to a smooth manifold with boundary, applying the Atiyah-Patodi-Singer index theorem, and taking a limit. We deduce corollaries related to …
Given a simple algebraic group , a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations. Following the work of Westbury, we produce a set of webs for $\SL_n$ which form a bas…