arXiv research

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By the uniqueness of the first eigenfunction of $p$-Laplacian, as $p\to 1,$ we ident…

Symmetric graphs flow without singularities on their axis.

The sinh-Gordon equation is solved on finite, symmetric graphs.

New nodal domain theorems for symmetric matrices via signed graphs.

Determinants of theta curves and symmetric graphs are studied.

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

We study the robustness to symmetric label noise of GNNs training procedures. By combining the nonlinear neural message-passing models (e.g. Graph Isomorphism Networks, GraphSAGE, etc.) with loss correction methods, we present a noise-tolerant approach for the graph classification task. Our experiments show that test a…

New algorithms learn simple staged trees from data, improving model fit.

This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold Laplacian when the sampling become infinitely dense. The convergence rate with …

Theory of symmetric rigidity in hyperbolic geometry.

The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.

We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoencoder has a newly designed decoder which builds a completely symmetric autoencoder form. For the re…

Estimates for graph embeddings into symmetric spaces derived from coarse geometry.

Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the n…

A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph which preserves the colouring of the vertices and extends to an orientation-preserving self-homeomorphism of the supporting surface. A dessin…

Defines new metric space sections with Ahlfors-David regularity.

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …

Graph Laplacians converge under symmetric divergence conditions.

Bayesian networks are simplified for categorical variables using staged trees and asymmetry-labeled DAGs.

In this paper, we compute the graph skein algebra of the punctured disk with two holes. Then, we apply the graph skein techniques developed here to establish necessary conditions for a spatial graph to have a symmetry of order $p$, where $p$ is a prime. The obstruction criteria introduced here extend some results obtai…

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where all meridians are mapped to transpositions. Incidentally, we verify the Meridio…

The study examines the independence of GKM manifolds and symmetric spaces.

Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the exterior derivative. As a result, we obtain the Grassmannian character of the lat…

Efficiently approximates eigenspaces for symmetric and general matrices.

We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lovasz. The class comprises examples of Stiefel manifolds, series of spheres and products of spheres, cubical surfaces, as well as examples of Seifert manifolds. Asymptotically, graph coloring manifolds provide examples of…

Graph manifolds' Thurston norms are sums of linear functionals, and every such norm can be realized.

Study cohomology of GL₂n(Z) and graph complexes using Pfaffian forms.

We study clustering algorithms based on neighborhood graphs on a random sample of data points. The question we ask is how such a graph should be constructed in order to obtain optimal clustering results. Which type of neighborhood graph should one choose, mutual k-nearest neighbor or symmetric k-nearest neighbor? What …

The study classifies and investigates translators invariant under hyperpolar actions on symmetric spaces.

Left invariant affine structures in a Lie group $G$ are in one-to-one correspondence with left-symmetric algebras over its Lie algebra $\mathfrak g=T_eG$ (``over'' means that the commutator $[x,y]=xy-yx$ coincides with the Lie bracket; left-symmetric algebras can be defined as Lie-admissible algebras such that the mult…

For any n>1 we give an explicit example of an n-axially symmetric Cartesian current in B^3 x S^2 with non-trivial vertical part and non-constant graph part minimizing the relaxed Dirichlet energy among the n-axially symmetric Cartesian currents with the same boundary. This stands in sharp contrast with a results of Har…

The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to …

Simplified computation of symmetric gl_1 homology for links.

We use the topological invariant of spatial graphs introduced by S. Yamada to find necessary conditions for a spatial graph to be periodic with a prime period. The proof of the main result is based on computing the Yamada skein algebra of the solid torus then proving that this algebra injects into the Kauffman bracket …

In the present paper we introduce Mobius energy for the embedded graphs and formulate its main properties. This energy is invariant under the action of the group generated by all inversions in three-dimensional real space. We study critical configurations for the angles at vertices of degree less than five, and discuss…

The paper calculates asymptotic Betti numbers and homology multiplicities for graph configuration spaces.

We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attributes in real-world graphs. We propose Non-linear Attributed Graph Clustering by Symmetric Non-negati…

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be…

New neural networks respect symmetries in symmetric tensors, improving efficiency and generalization.

A new approach to Morse theory using folded ribbon trees.

We show that a smooth radially symmetric solution $u$ to the graphic Willmore surface equation is either a constant or the defining function of a half sphere in ${\mathbb R}^3$. In particular, radially symmetric entire Willmore graphs in ${\mathbb R}^3$ must be flat. When $u$ is a smooth radial solution over a puncture…

A method to uniformly sample graph-encoded surfaces of fixed size.

Given a bordified space, Karlsson defines an incidence geometry of stars at infinity. These stars and their incidence are closely related to well-understood objects when the space is hyperbolic, CAT(0), or a bounded convex domain with the Hilbert metric. A question stemming from Karlsson's original paper was whether or…

New insights into ends of quotient spaces and graphs.

There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed t…

Paper tackles community recovery in binary symmetric SBM graphs.

Improved bipartite link prediction using 2-hop paths.

FastMap-D embeds directed graphs using potential fields.