Moser-Tardos resampling algorithm, entropy compression method and the subset gas

01/03/2020
by   Paula M. S. Fialho, et al.
0

We establish a connection between the entropy compression method and the Moser-Tardos algorithmic version of the Lovász local lemma through the cluster expansion of the subset gas. We also show that the Moser-Tardos resampling algorithm and the entropy compression bactracking algorithm produce identical bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2019

A Self-contained Analysis of the Lempel-Ziv Compression Algorithm

This article gives a self-contained analysis of the performance of the L...
research
06/26/2006

Entropy And Vision

In vector quantization the number of vectors used to construct the codeb...
research
05/20/2019

On the Second-Order Asymptotics of the Partially Smoothed Conditional Min-Entropy & Application to Quantum Compression

Recently, Anshu et al. introduced "partially" smoothed information measu...
research
12/07/2022

Image Compression With Learned Lifting-Based DWT and Learned Tree-Based Entropy Models

This paper explores learned image compression based on traditional and l...
research
10/10/2019

Network Entropy based on Cluster Expansion on Motifs for Undirected Graphs

The structure of the network can be described by motifs, which are subgr...
research
05/08/2023

Reviewed of the compression limit of an individual sequence using the Set Shaping Theory

Abstract: In this article, we will analyze in detail the coding limit of...
research
07/31/2020

Compression and Symmetry of Small-World Graphs and Structures

For various purposes and, in particular, in the context of data compress...

Please sign up or login with your details

Forgot password? Click here to reset