arXiv research

In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of…

The L1 loss landscape of neural nets near local minima behaves differently, revealing exponential decay and increased vertex density.

Investigates the vertex curve of smooth surfaces in 3D space, connecting geometry and image analysis.

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $α(L)$ for any knot or non-split link $L$, which are $b(L) \leq \frac{1}{2} c(L) +…

Graph matching with feature vectors is solved using a two-layer graph neural network.

Proposes methods to recover labels from shuffled networks using graph averages.

A new hypergraph expansion method treats vertices and hyperedges equally, improving node classification.

New method embeds correlation networks to reveal underlying time series patterns.

Let (V,W;F) be a weakly reducible, unstabilized, genus three Heegaard splitting in an orientable, irreducible 3-manifold M and DVW(F) the subset of the disk complex D(F) consisting of simplices having at least one vertex from V and at least one vertex from W. In this article, we describe the shape of DVW(F) and prove t…

Paper proves ribbonlength grows linearly with knot complexity.

This work develops a model to distinguish network and covariate information.

Vertex distortion detects if a knot is unknot.

The study finds the bounds of vertex orbits in maps derived from specific lattices.

The 4-dimensional abstract Kummer variety K^4 with 16 nodes leads to the K3 surface by resolving the 16 singularities. Here we present a simplicial realization of this minimal resolution. Starting with a minimal 16-vertex triangulation of K^4 we resolve its 16 isolated singularities - step by step - by simplicial blowu…

Given a vertex of interest in a network $G_1$, the vertex nomination problem seeks to find the corresponding vertex of interest (if it exists) in a second network $G_2$. A vertex nomination scheme produces a list of the vertices in $G_2$, ranked according to how likely they are judged to be the corresponding vertex of …

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

Proposes a new method to describe graph vertex features using characteristic functions.

Method analyzes large-scale network data to detect communication pattern shifts.

This paper shows semi-equivelar toroidal maps are vertex-transitive covers.

Defines formal vertex laws related to Lie conformal algebras.

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$ (mod $6$), but there doesn't exist vertex-transitive map of such types. In particu…

The study examines vertices in curves with singular points in the Euclidean plane.

Vertex distortion measures how far lattice knots deviate from straight lines.

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…

We prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

New proof for global rigidity of vertex scaling on polyhedral surfaces.

Tree++ graph kernel captures similarities at multiple granularities.

Proves a generalized Whitehead cut vertex lemma for tree groups.

Solves Skopenkov's problem on graph embedding criteria.

A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, …

Efficient method for vertex embedding and community detection.

New invariants distinguish spatial graphs not previously possible.

Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical re…

The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.

The paper concerns discrete versions of the three well-known results of projective differential geometry: the four vertex theorem, the six affine vertex theorem and the Ghys theorem on four zeroes of the Schwarzian derivative. We study geometry of closed polygonal lines in $\bbRP^d$ and prove that polygons satisfying a…

Proofs for Moon's theorem and its generalization.

Let $M$ be a Riemannian manifold. For $p\in M$, the tensor algebra of the negative part of the (complex) affinization of the tangent space of $M$ at $p$ has a natural structure of a meromorphic open-string vertex algebra. These meromorphic open-string vertex algebras form a vector bundle over $M$ with a connection. We …

Study finds root vertex in large networks with high probability.

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal G-trees with edge stabilizers in $\mathcal{A}$. We show vertex finiteness when G…

Researchers link vertex algebras to non-Kähler solutions of the Hull-Strominger system.

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively quasiconvex if and only if all the vertex groups have finite relative height in the f…

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are quasi-isometric if and only if every one-ended vertex group of A is quasi-isometric to…

The study proves unique harmonic functions and combinatorial properties of vertex-transitive graphs.

Enhances graph classification with multiple graphs.

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

While many multiple graph inference methodologies operate under the implicit assumption that an explicit vertex correspondence is known across the vertex sets of the graphs, in practice these correspondences may only be partially or errorfully known. Herein, we provide an information theoretic foundation for understand…

Two spectral algorithms for community detection in graphs with covariates are compared.