DeepAI AI Chat
Log In Sign Up

Embedded-Graph Theory

by   Atsushi Yokoyama, et al.

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated relations, which cannot be expressed by the existing edge-graphs or weighted-graphs. We introduce the mathematical definition of embedded-graph, translation, edge distance, and graph similarity. We can transform an embedded-graph into a weighted-graph and a weighted-graph into an edge-graph by the translation method and by threshold calculation, respectively. The edge distance of an embedded-graph is a distance based on the components of a target vector, and it is calculated through cosine similarity with the target vector. The graph similarity is obtained considering the relations with linguistic complexity. In addition, we provide some examples and data structures for embedded-graphs in this paper.


page 1

page 2

page 3

page 4


Strong Hanani-Tutte for the Torus

If a graph can be drawn on the torus so that every two independent edges...

Weighted Additive Spanners

An α-additive spanner of an undirected graph G=(V, E) is a subgraph H su...

Flooding edge or node weighted graphs

Reconstruction closings have all properties of a physical flooding of a ...

Perturbation results for distance-edge-monitoring numbers

Foucaud et al. recently introduced and initiated the study of a new grap...

Linguistic Inspired Graph Analysis

Isomorphisms allow human cognition to transcribe a potentially unsolvabl...

A Novel Weighted Distance Measure for Multi-Attributed Graph

Due to exponential growth of complex data, graph structure has become in...

Towards Similarity Graphs Constructed by Deep Reinforcement Learning

Similarity graphs are an active research direction for the nearest neigh...