A pattern theorem for lattice clusters
type: Item
instance of: scholarly article
title: A pattern theorem for lattice clusters
zbMATH Open document ID: 0935.60089
DOI: 10.1007/BF01608793
author: Neal Madras
published in: Annals of Combinatorics
publication date: 1999-12-20T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/9902161
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 82B43
Mathematics Subject Classification ID: 82B41
zbMATH DE Number: 1347718
zbMATH Keywords: self-avoiding walk
zbMATH Keywords: lattice animal
zbMATH Keywords: percolation
zbMATH Keywords: pattern theorem
zbMATH Keywords: growth constant
MaRDI profile type: MaRDI publication profile
arXiv ID: math/9902161
cites work: Submaps of maps. I: General 0-1 laws
cites work: An Introduction to the Geometry of Numbers
cites work: Q5827372
cites work: The number and size of branched polymers in high dimensions
cites work: Metropolis Monte Carlo simulation of lattice animals
cites work: Entanglement complexity of lattice ribbons
cites work: On the Number of Self-Avoiding Walks
cites work: Cell Growth Problems
cites work: A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
cites work: Q4693177
cites work: Statistics of lattice animals
cites work: The free energy of a collapsing branched polymer
cites work: Q3972642
cites work: Self-avoiding walks and polygons on non-Euclidean lattices
cites work: Lattice Models of Polymers
Recommended article: New pattern theorems for square lattice self-avoiding walks and self-avoiding polygons
Recommended article: Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields
Recommended article: Statistics of lattice animals
Recommended article: A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
description: scientific article