Statistical mechanics, structure of matter Exactly solved models Object
Bethe lattice
Builds on TreeRegular graph
Description
Let be an integer. The Bethe lattice of coordination number is the infinite connected tree in which every vertex has degree exactly . It is unique up to graph isomorphism, and it is a regular graph of degree . For it is the graph with edges between consecutive integers.
Remarks
Fix a vertex , the root. For there are exactly vertices at distance from , so the number of vertices grows exponentially in the distance when . As a result, for , in a finite ball the boundary vertices make up a fixed positive fraction of all vertices. So statistical models on it are studied deep inside the tree, away from the boundary. Since the tree has no cycles, models such as the Ising model can be solved exactly on it by recursion from the leaves. For the ferromagnetic Ising model with coupling and no field, the critical inverse temperature satisfies . This solution coincides with the Bethe–Peierls approximation for a lattice with coordination number , which is the origin of the name. For it is the Cayley graph of a free product of copies of .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Regular graph concept
- Tree concept
- Bethe lattice object
Further reading
About this page
| Tag | 9NR5VKEJ51 |
|---|---|
| URI | m2://9NR5VKEJ51 |
| Kind | object |
| Writing | W0 stub |
| MSC | 82B20, 82B23, 05C05 |
| Instance of | Tree, Regular graph |
| Uses | Tree, Regular graph |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.