Linked Cluster Expansions Beyond Nearest Neighbor Interactions: Convergence and Graph Classes
From MaRDI portal
Publication:4211940
DOI10.1142/S0217751X97001924zbMATH Open0973.82505arXivhep-lat/9604021OpenAlexW2006429144MaRDI QIDQ4211940FDOQ4211940
Authors: Andreas Pordt, T. Reisz
Publication date: 15 October 1998
Published in: International Journal of Modern Physics A (Search for Journal in Brave)
Abstract: We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way that the classes of graphs to be considered are identical to those of the pure nearest neighbour interaction. The only change then concerns the computation of lattice imbedding numbers. All the complications that arise can be reduced to a generalization of the notion of free random walks, including hopping beyond nearest neighbour. Explicit expressions for combinatorical numbers of the latter are given. We show that under some general conditions the linked cluster expansion series have a non-vanishing radius of convergence.
Full work available at URL: https://arxiv.org/abs/hep-lat/9604021
Recommendations
- scientific article; zbMATH DE number 4078467
- Linked-cluster expansion of the Ising model
- Graph rules for the linked cluster expansion of the Legendre effective action
- DYNAMICAL LINKED CLUSTER EXPANSIONS: A NOVEL EXPANSION SCHEME FOR POINT–LINK–POINT INTERACTIONS
- Dynamical linked cluster expansions: algorithmic aspects and applications
Critical phenomena in equilibrium statistical mechanics (82B27) Constructive quantum field theory (81T08)
Cites Work
Cited In (8)
- Cluster adjacency beyond MHV
- DYNAMICAL LINKED CLUSTER EXPANSIONS: A NOVEL EXPANSION SCHEME FOR POINT–LINK–POINT INTERACTIONS
- A connected graph identity and convergence of cluster expansions
- Transformation and topological reduction of cluster expansions using \(m\)-bonds
- Dynamical linked cluster expansions: algorithmic aspects and applications
- Nonlocal, noncommutative diagrammatics and the linked cluster theorems
- Graph rules for the linked cluster expansion of the Legendre effective action
- Hopping parameter series construction for models with non-trivial vacuum
This page was built for publication: Linked Cluster Expansions Beyond Nearest Neighbor Interactions: Convergence and Graph Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4211940)