Hard Core via PCA: Entropy Bounds

DOI10.1007/978-3-662-47221-7_7MaRDI QIDQ5500615zbMATH OpenOpenAlexFDO

Authors Kari Eloranta

Publication date 7 August 2015

Published in Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.4035, https://hal.inria.fr/hal-01442484/file/338243_1_En_7_Chapter.pdf

zbMATH Keywords

hard core modelindependent setstopological entropy

Mathematics Subject Classification ID

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Topological entropy (37B40)

Abstract: We establish lower bounds for the entropy of the Hard Core Model on a few 2d lattices $$ In this model the allowed configurations inside $$ are the one's in which the nearest neighbor $scriptstyle1$'s are forbidden. Our method which is based on a sequential fill-in scheme is unbiassed and thereby yields in principle arbitrarily good estimates for the topological entropy. The procedure also gives some detailed information on the support of the measure of maximal entropy.

Recommendations

• Approximating the hard square entropy constant with probabilistic methods
• Entropy-based bounds on dimension reduction in L^1
• High-probability bounds for the reconstruction error of PCA
• scientific article; zbMATH DE number 7650426
• The Entropy Per Coordinate of a Random Vector is Highly Constrained Under Convexity Conditions
• Independent Component Analysis by Entropy Bound Minimization
• Entropy minimization with lattice bounds
• Arbitrarily Tight Bounds on Differential Entropy of Gaussian Mixtures
• The complexity of estimating Rényi entropy

Cited in

(2)

• An entropy approach to the hard-core model on bipartite graphs
• Maximum gaps in one-dimensional hard-core models

This page was built for publication: Hard Core via PCA: Entropy Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500615)