Bethe lattice
From Wikipedia, the free encyclopedia
"Cayley tree" redirects here. For finite trees with equal-length root-to-leaf paths, see ordered Bell number.
In statistical mechanics and mathematics, the Bethe lattice (also called a regular tree) is an infinite connected cycle-free graph where all vertices have the same number of neighbors. The Bethe lattice was introduced into the physics literature by Hans Bethe in 1935. In such a graph, each node is connected to z neighbors; the number z is called either the coordination number or the degree, depending on the field.
Due to its distinctive topological structure, the statistical mechanics of lattice models on this graph are often easier to solve than on other lattices. The solutions are related to the often used Bethe ansatz for these systems.