%0 Conference Proceedings
%T Hard Core via PCA: Entropy Bounds
%+ Aalto University
%A Eloranta, Kari
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%I Springer
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 85-98
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_7
%K Topological entropy
%K Independent sets
%K Hard core model
%Z Computer Science [cs]Conference papers
%X We establish bounds for the entropy of the Hard Core Model/Independent Sets on a few 2-d lattices. Our PCA-based sequential fill-in method yields an increasing sequence of lower bounds for the topological entropy. Additionally the procedure gives some insight on the support of the measure of maximal entropy. The method also applies to other lattices and models with appropriate sublattice splitting.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442484/document
%2 https://inria.hal.science/hal-01442484/file/338243_1_En_7_Chapter.pdf
%L hal-01442484
%U https://inria.hal.science/hal-01442484
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA