arXiv research

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…

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 …

Defines formal vertex laws related to Lie conformal algebras.

Abstract studies 3-manifolds and vertex algebras, expanding known connections.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

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…

Paper studies vertex correspondence recovery in correlated graphs with node features.

New methods cluster and test graphs without vertex correspondence.

Graph Lie algebras have infinite prolongation if they have a vertex of degree one.

We construct a spectral sequence that converges to the cohomology of the chiral de Rham complex over a Calabi-Yau hypersurface and whose first term is a vertex algebra closely related to the Landau-Ginburg orbifold. As an application, we prove an explicit orbifold formula for the elliptic genus of Calabi-Yau hypersurfa…

Given a pair of graphs $G_1$ and $G_2$ and a vertex set of interest in $G_1$, the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in $G_2$ (if they exist) and produce a rank list of the vertices in $G_2$, with the corresponding vertices of interest in $G_2$ concentrating, ideally, at…

Developing tools for computing string amplitudes with hyperbolic vertices.

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering lines and circles in the plane. Finally, we give matrix generators in $\mathrm{…

The paper introduces a quantum state system to count perfect matchings in graphs.

Mathematical construction of vertex algebra representations from integrable G2 structures.

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,…

The paper introduces a method for detecting principal communities and embedding vertices.

The study proves spherical polygon analogs of curve theorems, finding bounds on intersections and inflections.

We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery guarantees established in the companion paper for Gaussian weights, in this work,…

Given a tiling $\mathcal{T}$ of the plane by straight edge polygons, which is invariant by two independent translations, we construct a family of embedded triply periodic minimal surfaces which desingularizes $\mathcal{T}\times\mathbb{R}$. For this purpose, inspired by the work of Martin Traizet, we open the nodes of s…

Discrete conformal maps on surfaces with vertex decorations are studied.

A Seifert surgery is an integral surgery on a knot in S^3 producing a Seifert fiber space which may contain an exceptional fiber of index 0. The Seifert Surgery Network is a 1-dimensional complex whose vertices correspond to Seifert surgeries; its edges correspond to single twistings along "seiferters" or "annular pair…

The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding…

We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage essentially corresponds to the usage of the products of Macdonald polynomials and is …

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

Vertex distortion detects if a knot is unknot.

A piecewise flat Finsler metric on a triangulated surface $M$ is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of geodesics on a piecewise flat Finsler surface, especially when it meets a vertex…

Assume that Γ_{v_0} is a tree with vertex set Vert(Γ_{v_0})={v_0, v_1,..., v_n}, and with an integral framing (weight) attached to each vertex except v_0. Assume furthermore that the intersection matrix of G=Γ_{v_0}-{v_0} is negative definite. We define a filtration on the chain complex computing the lattice homology o…

For the root system of type $B_l$ and $C_l$, we generalize the result of \cite{DZ1998} by showing the existence of a Frobenius manifold structure on the orbit space of the extended affine Weyl group that corresponds to any vertex of the Dynkin diagram instead of a particular choice of \cite{DZ1998}.

Approximates cycles in planar and bounded-genus graphs.

The study embeds graphs on translation surfaces, proving essential-systolic embeddings and estimating surface genera.

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

We study relationships between the restricted unrolled quantum group $\overline{U}_q^H(\mathfrak{sl}_2)$ at $2r$-th root of unity $q=e^{πi/r}, r \geq 2$, and the singlet vertex operator algebra $\mathcal M(r)$. We use deformable families of modules to efficiently compute $(1, 1)$-tangle invariants colored with projecti…

The study explores maps of 2- and 3-uniform tilings on the torus.

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

Asymptotics of quantum $6j$ symbols corresponding to a hyperbolic tetrahedra is investigated and the first two leading terms are determined for the case that the tetrahedron has a ideal or ultra-ideal vertex. These terms are given by the volume and the determinant of the Gram matrix of the tetrahedron. A relation to th…

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

The theory of multidimensional Poisson vertex algebras (mPVAs) provides a completely algebraic formalism to study the Hamiltonian structure of PDEs, for any number of dependent and independent variables. In this paper, we compute the cohomology of the PVAs associated with two-dimensional, two-components Poisson bracket…

Mark all vertices on a curve evolving under a family of curves obtained by intersecting a smooth surface M with the 1-parameter family of planes parallel to the tangent plane to M at a point p. Those vertices trace out a set, called the vertex set of M through p. We take p to be an isolated umbilic point on M and descr…

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.

Power of network tests degrades when vertices are misaligned.

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.

Efficient algorithm for matching graphs with community structure.

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

Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA)…