Graph Compression -- Save Information by Exploiting Redundancy

Details Graph Compression -- Save Information by Exploiting Redundancy Graph Compression -- Save Information by Exploiting Redundancy

2007-12-20

arxiv.org/abs/0712.3312v1

Physics

Condensed Matter

Statistical Mechanics

19 pages, 9 figures

Scientific paper

10.1088/1742-5468/2008/06/P06001

In this paper we raise the question of how to compress sparse graphs. By introducing the idea of redundancy, we find a way to measure the overlap of neighbors between nodes in networks. We exploit symmetry and information by making use of the overlap in neighbors and analyzing how information is reduced by shrinking the network and using the specific data structure we created, we generalize the problem of compression as an optimization problem on the possible choices of orbits. To find a reasonably good solution to this problem we use a greedy algorithm to determine the orbit of symmetry identifications, to achieve compression. Some example implementations of our algorithm are illustrated and analyzed.

Affiliated with

Also associated with

No associations

Rating

Graph Compression -- Save Information by Exploiting Redundancy 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 Graph Compression -- Save Information by Exploiting Redundancy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Compression -- Save Information by Exploiting Redundancy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2491