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.
Type de document :
Communication dans un congrès
Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.85-98, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_7〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01442484
Contributeur : Hal Ifip <>
Soumis le : vendredi 20 janvier 2017 - 16:09:45
Dernière modification le : lundi 23 janvier 2017 - 15:28:37
Document(s) archivé(s) le : vendredi 21 avril 2017 - 15:45:22

Fichier

338243_1_En_7_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Kari Eloranta. Hard Core via PCA: Entropy Bounds. Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.85-98, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_7〉. 〈hal-01442484〉

Partager

Métriques

Consultations de la notice

31