Related papers: A Coordinate System for Graphs
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
On the Euclidean domains of classical signal processing, linking of signal samples to the underlying coordinate structure is straightforward. While graph adjacency matrices totally define the quantitative associations among the underlying…
Graph matching is the process of computing the similarity between two graphs. Depending on the requirement, it can be exact or inexact. Exact graph matching requires a strict correspondence between nodes of two graphs, whereas inexact…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper…
Ontology matching is defined as finding a relationship or correspondence between two or more entities in two or more ontologies. To solve the interoperability problem of the domain ontologies, semantically similar entities in these…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…