Bethe lattice

  A Bethe lattice or Cayley tree, introduced by Hans Bethe in 1935, is a connected cycle-free graph where each node is connected to z neighbours, where z is called the coordination number. It can be seen as a tree-like structure emanating from a central node, with all the nodes arranged in shells around the central one. The central node may be called the root or origin of the lattice. The number of nodes in the kth shell is given by

N_k = z(z − 1)^{k − 1} for k > 0.

Additional recommended knowledge

Better weighing performance in 6 easy steps

Don't let static charges disrupt your weighing accuracy

How to quickly check pipettes?

In some situations the definition is modified to specify that the root node has z − 1 neighbours.

Due to its distinctive topological structure, the statistical mechanics of lattice models on this graph are often exactly solvable. The solutions are related to the often used Bethe approximation for these systems.

Note that the Bethe lattice visually resembles the Cayley graph used to visualize the structure of groups. Bethe lattices also occur as the discrete group subgroups of certain hyperbolic Lie groups, such as the Fuchsian groups. As such, they are also lattices in the sense of a lattice in a Lie group.

References

• H. A. Bethe, Statistical theory of superlattices, Proc. Roy. Soc. London Ser A, 150 ( 1935 ), pp. 552-575.