Hard Core via PCA: Entropy Bounds

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01442484
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:45 PM
Last modification on : Monday, January 23, 2017 - 3:28:37 PM
Long-term archiving on : Friday, April 21, 2017 - 3:45:22 PM

File

338243_1_En_7_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Kari Eloranta. Hard Core via PCA: Entropy Bounds. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.85-98, ⟨10.1007/978-3-662-47221-7_7⟩. ⟨hal-01442484⟩

Share

Metrics

Record views

89

Files downloads

158