Lossless Representation of Graphs using Distributions

Details Lossless Representation of Graphs using Distributions Lossless Representation of Graphs using Distributions

2007-10-09

arxiv.org/abs/0710.1870v1

Mathematics

Combinatorics

19 pages

Scientific paper

We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their sub-triangles. In the second part, we propose graph representations in terms of one-dimensional distributions (e.g., distribution of the node weights, sum of adjacent weights, etc.). For the case when the weights of the graph are real-valued vectors, we show that all graphs, except for a set of measure zero, are uniquely determined, up to isomorphism, from these distributions. The motivating application for this paper is the problem of browsing through large sets of graphs.

Affiliated with

Also associated with

No associations

Rating

Lossless Representation of Graphs using Distributions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lossless Representation of Graphs using Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless Representation of Graphs using Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461886