Graph Data Compression: Practical Methods and Information-Theoretic Limits

Add to your list(s) Download to your calendar using vCal

• Prof. Justin Coon, University of Oxford
• Wednesday 07 May 2025, 14:00-15:00
• MR5, CMS Pavilion A.

If you have a question about this talk, please contact Prof. Ramji Venkataramanan.

Many modern datasets possess complex correlation structures. Such data is typically stored as graphs. Examples of graph data include social networks, web graphs, biological networks, and neural networks. These graph datasets often contain hundreds of millions of nodes and billions of edges, which leads to a significant problem in terms of storage and processing. Therefore, there is need to compress graphs and store them efficiently without losing much information. In this talk, I will give an introduction to the developing field of graph compression. I will discuss the basic problems encountered in practice and some of the solutions that have been proposed. I will also present a few results detailing information theoretic limits on compressing graphs.

This talk is part of the Information Theory Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Information Theory Seminar
• Interested Talks
• MR5, CMS Pavilion A
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.