Counting contours on trees
From MaRDI portal
Publication:2397386
Abstract: We calculate the exact number of contours of size containing a fixed vertex in -ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex.
Recommendations
Cites work
- A contour method on Cayley trees
- A course on large deviations with an introduction to Gibbs measures
- A manifold of pure Gibbs states of the Ising model on the Lobachevsky plane
- Amenability and phase transition in the Ising model
- An extremal problem for sets with applications to graph theory
- Analytic combinatorics
- Counting regions with bounded surface area
- Cut sets and normed cohomology with applications to percolation
- Gibbs measures and phase transitions
- Gibbs measures on Cayley trees
- Gibbs measures on Cayley trees: results and open problems
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1332581 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- Improved Peierls argument for high-dimensional Ising models
- On \(q\)-component models on Cayley tree: contour method
- On generalized graphs
- On Ising's model of ferromagnetism
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Percolation on infinite graphs and isoperimetric inequalities
- Phase transition in ferromagnetic Ising models with non-uniform external magnetic fields
- Statistical Mechanics of Disordered Systems
Cited in
(4)
This page was built for publication: Counting contours on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397386)